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
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; }
相关文章推荐
- 清华人都如此努力,那我们呢?
- TCAP以及MAP介绍
- sql 语句日期用法及函数
- PHP中::、->、self、$this操作符的区别
- transition插件
- Zabbix的安装和简单配置(一)
- eclipse安装C++工程环境----CDT环境————eclipse开发openCV环境准备1
- Serializable:readResolve
- 散户的福音:4G+
- Inno setup 界面汉化资源
- java覆写hashcode方法
- 十分钟搞定pandas
- [Selenium2]+Eclipse+Java环境搭建
- Linux系统NFS服务实战
- ubuntu 重启 nginx 失败,* Restarting nginx nginx ...fail!
- SSL
- Permutations II 字符全排列 去除重复的
- Android高级用法之attrs使用
- Android的WebView通过JS调用java代码
- [Selenium 2]―WebDriver 驱动说明