codeforcesGym 101102H
2016-10-11 20:40
260 查看
这个就是这么回事,0(n)选取,然后就是这么回事ok,有点类似尺取法
#include<cstring> #include<cstdio> #include<algorithm> using namespace std; const int N = 1e5 + 10; char a[N + 10] ; int main() { int t , n , m ; scanf("%d",&t); while(t--){ int flag = 1; scanf("%d %d",&n ,&m); scanf("%s",a); int l = 0 , r = 0 , num = 0; while(l < n && r < n){ //printf("a[%d] = %c\n",l , a[l]); if(a[l] == '0' ){ //printf("*\n"); num = 1; r = l + 1; while(a[r] == '0' && r < n){ num++; r++; } //printf("r = %d num = %d\n",r,num); if(num > m){ flag = 0; printf("yes\n"); break; } l = r; } l++; //getchar(); } if(flag) printf("no\n"); } }
相关文章推荐
- codeforces Gym 100187F F - Doomsday 区间覆盖贪心
- Codeforces gym 100792B Banana Brain's Bracelet - z-box算法
- Codeforces Gym 100513G G. FacePalm Accounting 暴力
- Codeforces Gym 100962 H. Hans Zimmer
- Codeforces Gym 100342J Problem J. Triatrip 求三元环的数量 bitset
- codeforces Gym 100418D BOPC 打表找规律,求逆元
- Codeforces Gym 100286B Blind Walk DFS
- CodeForces Gym 101745 简要题解
- Codeforces Gym 100523E E - Gophers SET
- Codeforces Gym 100431G Persistent Queue 可持久化队列
- Codeforces Gym 100650B Countdown (离线)
- Codeforces Gym 100338I TV Show 傻逼DFS,傻逼题
- [Trie树建图 2-SAT] Codeforces Gym 101190 NEERC 16 B. Binary Code
- Codeforces Gym 100002 Problem F "Folding" 区间DP
- Codeforces Gym 100342H Hard Test 构造
- codeforces gym-101745 C-Infinite Graph Game 分块
- CodeForcesGym 100735H Words from cubes
- Codeforces Gym 101505D Orchard Division(离散化+树状数组+扫描线+二分)
- Codeforces Gym 100971M Decomposition into Good Strings DP+数据结构
- 【Codeforces Gym - 100187J】 + DFS