#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, d;
cin >> n >> d;
int count = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
int cur;
cin >> cur;
if (cur == 0) {
count++;
} else {
count = 0;
}
if (count >= d) {
ans++;
count = 0;
}
}
cout << ans << endl;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
256 KB |
Output is correct |
2 |
Correct |
5 ms |
512 KB |
Output is correct |
3 |
Correct |
4 ms |
288 KB |
Output is correct |
4 |
Correct |
5 ms |
256 KB |
Output is correct |
5 |
Correct |
5 ms |
308 KB |
Output is correct |
6 |
Correct |
4 ms |
256 KB |
Output is correct |
7 |
Correct |
5 ms |
384 KB |
Output is correct |
8 |
Correct |
62 ms |
256 KB |
Output is correct |
9 |
Correct |
62 ms |
256 KB |
Output is correct |
10 |
Correct |
63 ms |
256 KB |
Output is correct |