题解 | 数组计数维护
数组计数维护
https://www.nowcoder.com/practice/47ee4c040f1648fc9ef7732d35402676
#include <stdio.h>
void b(int a[50], int n, int m) {
int S = 0, cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= m) {
S = S + a[i];
}
if (a[i] == 0 && S >= 1) {
S = S - 1;
cnt = cnt + 1;
}
}
printf("%d\n", cnt);
}
int main() {
int k, n, m, a[50] = {0};
scanf("%d", &k);
for (int i = 0; i < k; i++) {
scanf("%d %d", &n, &m);
for (int j = 0; j < n; j++) {
scanf("%d", &a[j]);
}
b(a, n, m);
}
}
查看29道真题和解析
