CF18C Stripe

题目描述
Once Bob took a paper stripe of nn 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?

输入格式
The first input line contains integer nn ( 1<=n<=10^{5}1<=n<=10
5
) — amount of squares in the stripe. The second line contains nn space-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 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.

题意翻译
给定一整数n，下面有n个数a[i]，求将该数列分割成两个非空数列且两个数列内数字的和相等的方案数 1<=n<=10^5 a[i]的绝对值不大于10000

Translated by 稀神探女

#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <queue>
#include <climits>
#include <map>
#include <cmath>
using namespace std;
typedef long long ll;
const int maxn=1e5+10;
int n,a[maxn];
int s[maxn];
int main()
{
   cin>>n;
   for(int i=1;i<=n;i++){
     cin>>a[i];
     s[i]=s[i-1]+a[i];
   }
   int ans=0;
   for(int i=1;i<n;i++){
     if(s[i]==s[n]-s[i]){
       ans++;
     }
   }
   cout<<ans<<endl;
  return 0;
}