CodeForces 18C - Stripe 解题心得
2015-08-07 20:41
260 查看
原题:
Description
Once Bob took a paper stripe of n squares (the height of the stripe is 1 square). In each square he wrote an integer number, possibly negative. He became interested in how many ways exist to cut this stripe into two pieces so that the sum of numbers from one piece is equal to the sum of numbers from the other piece, and each piece contains positive integer amount of squares. Would you help Bob solve this problem?
Input
The first input line contains integer n (1 ≤ n ≤ 105) — amount of squares in the stripe. The second line contains nspace-separated numbers — they are the numbers written in the squares of the stripe. These numbers are integer and do not exceed 10000 in absolute value.
Output
Output the amount of ways to cut the stripe into two non-empty pieces so that the sum of numbers from one piece is equal to the sum of numbers from the other piece. Don't forget that it's allowed to cut the stripe along the squares' borders only.
Sample Input
Input
Output
Input
Output
Input
Output
Description
Once Bob took a paper stripe of n squares (the height of the stripe is 1 square). In each square he wrote an integer number, possibly negative. He became interested in how many ways exist to cut this stripe into two pieces so that the sum of numbers from one piece is equal to the sum of numbers from the other piece, and each piece contains positive integer amount of squares. Would you help Bob solve this problem?
Input
The first input line contains integer n (1 ≤ n ≤ 105) — amount of squares in the stripe. The second line contains nspace-separated numbers — they are the numbers written in the squares of the stripe. These numbers are integer and do not exceed 10000 in absolute value.
Output
Output the amount of ways to cut the stripe into two non-empty pieces so that the sum of numbers from one piece is equal to the sum of numbers from the other piece. Don't forget that it's allowed to cut the stripe along the squares' borders only.
Sample Input
Input
9 1 5 -6 7 9 -16 0 -2 2
Output
3
Input
3 1 1 1
Output
0
Input
2 0 0
Output
1 分析:从头到尾扫一次就行了,每扫一个累加前面所以项的和,再把判断2倍和是不是等于总和就可以了 ,复杂度为n 代码:
#include<iostream> #include<algorithm> #include<cstdio> #include<cstring> using namespace std; int a[100000 + 10]; int t_left[100000 + 10]; int sum; int main() { int cnt = 0; int *p = a; int n; cin >> n; for (int i = 0; i < n; i++) { scanf("%d", a + i); if (i == 0) t_left[i] = a[i]; t_left[i] = t_left[i - 1] + a[i]; sum += a[i]; } for (int i = 0; i < n-1; i++) { if (2 * t_left[i] == sum) cnt++ ; } cout << cnt << endl; return 0; }
相关文章推荐
- 关于XAMPP 无法启动mysql的解决方法
- 杭电 2047 阿牛的EOF牛肉串
- iOS开发_杂谈
- Subset sequence
- 关于线程的一点补充
- HDU 1875 畅通工程再续 prim算法 最小生成树
- LSM-Tree (BigTable 的理论模型)
- verilog中的循环语句
- Kmeans算法介绍及其实现
- POJ 2406 Power Strings(KMP 找最短循环节)
- csu 1115 最短的名字(字典树)解题报告
- HDU 2955 Robberies
- UVALive - 2519 Radar Installation 解题心得
- 常用的一些文件操作函数
- poj 2752 Seek the Name, Seek the Fame 【在原串中 找所有既是原串前缀又是原串后缀的子串长度】
- 为什么不在服务器上装Linux发行版本
- mongodb部署一个集群
- CString转System::String ^应用实例
- vim初学
- CodeForces 492B Vanya and Lanterns 解题心得