您的位置:首页 > 其它

TOJ 4112 Counting problem

2015-07-08 14:07 330 查看
Simple problem;

The work you should do is calculate the sum of prefix;

The portal:http://acm.tju.edu.cn/toj/showp4112.html

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>

int sum[200005];

void Deal_with(){
int T;
scanf("%d",&T);
while(T--){
sum[0] = 0;
int n,temp;
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&temp);
sum[i] = sum[i-1] + temp;
//printf("%d\n",sum[i]);
}
int C;
scanf("%d",&C);
int cnt = 0,i = 0,j = 1;
while(i<=n){
if(sum[j] - sum[i] == C){
cnt ++;
j ++ ; i ++ ;
if(j > n) break;
}
else if(sum[j] - sum[i] < C){
j ++;
if(j > n) break;
}
else {
i ++;
}
}
printf("%d\n",cnt);
}
}

int main(void){
//freopen("a.in","r",stdin);
Deal_with();
return 0;
}
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: