#include<cstdio>
#include<cstring>
#include<cmath>
#include<climits>
#include<cctype>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<stack>
#define ll __int64
#define MAX 1000000
#define INF INT_MAX
#define eps 1e-8
using namespace std;
ll a[MAX],b[MAX],c[MAX];
int cnt[MAX];
int main(){
int n;
while (scanf("%d",&n) != EOF){
b[0] = c[n+1] = 0;
ll sum = 0;
memset(cnt,0,sizeof(cnt));
for (int i = 1; i<=n; i++){
scanf("%I64d",&a[i]);
sum += a[i];
b[i] = b[i-1] + a[i];
}
ll s = sum / 3;
if (sum % 3 != 0){
printf("0\n");
continue;
}
for (int i = n; i>=1; i--)
c[i] = c[i+1] + a[i];
for (int i = n; i>=1; i--)
if (c[i] == s)
cnt[i] = cnt[i+1] + 1;
else
cnt[i] = cnt[i+1];
ll ans = 0;
for (int i = 1; i<n-1; i++)
if (b[i] == s)
ans += cnt[i+2];
printf("%I64d\n",ans);
}
return 0;
}
Codeforces Round #266 (Div. 2) C Number of Ways
最新推荐文章于 2017-03-15 20:45:32 发布