题解 | 数组计数维护
数组计数维护
https://www.nowcoder.com/practice/47ee4c040f1648fc9ef7732d35402676
#include <iostream>
#include <vector>
//尽量不使用std命名空间
int main()
{
int n = 0;
int k = 0;
int S = 0;
int cnt = 0;
int T = 0;
std::vector<int> a;
//定义初始要用到的变量
std::cin>>T;
for (int i2 = 1;i2 <= T;i2++)
{
std::cin>>n>>k;
a.resize(n+1);
for (int i1 = 1;i1 <= n;i1++)
{
std::cin>>a[i1];
}
for (int i3 = 1;i3 <= n;i3++)
{
if (a[i3] >= k)
{
S += a[i3];
}
else if (a[i3] == 0 && S >= 1)
{
S -= 1;
cnt += 1;
}
}
std::cout<<cnt<<std::endl;
S = 0;
cnt = 0;//再次初始化
}
//进行处理
return 0;
}

