Codeforces--466C--Number of Ways

题目描述：
You’ve got array a[1], a[2], …, a[n], consisting of n integers. Count the number of ways to split all the elements of the array into three contiguous parts so that the sum of elements in each part is the same.

More formally, you need to find the number of such pairs of indices i, j (2 ≤ i ≤ j ≤ n - 1), that .
输入描述:
The first line contains integer n (1 ≤ n ≤ 5·105), showing how many numbers are in the array. The second line contains n integers a[1], a[2], …, a[n] (|a[i]| ≤  109) — the elements of array a.
输出描述:
Print a single integer — the number of ways to split the array into three parts with the same sum.
输入：
5
1 2 3 0 3
4
0 1 -1 0
2
4 1
输出：
2
1
0
题意：
给定一个序列，问有多少种方案可以将此序列分割成3个序列元素和完全相同的子序列。（子序列不能为空）。即问有多少个点对（i,j）满足a[1]+…+a[i-1]=a[i]+a[i+1]+…+a[j]=a[j+1]+a[j+2]+…+a[n]
题解：
直接找ave处，2ave处
代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;

typedef long long ll;
const int maxn = 500000 + 5;
ll a[maxn],sum[maxn];


int main(){
    int n;
    while(scanf("%d",&n)!=EOF){
        memset(sum,0,sizeof(sum));
        for(int i = 1; i <= n; i ++){
            scanf("%lld",&a[i]);
            sum[i] = sum[i - 1] + a[i];
        }
        //cout<<sum[n]<<endl;
        if(sum[n] % (ll)3 != 0){
            printf("0\n");
        }
        else{
            ll ave = sum[n] / (ll)3;
            if(ave == 0){
                int x = 0;
                for(int i = 1; i < n; i ++){
                    if(sum[i] == 0) x ++;
                }
                printf("%lld\n", (ll)x * (x - 1) / 2);
            }
            else{
                ll ans = 0;
                ll cnt = 0;
                for(int i = 1; i <= n; i ++){
                    if(sum[i] == ave) cnt ++;
                    if(sum[i] == ave * 2) ans += cnt;
                }
                printf("%lld\n",ans);
            }
        }
    }
    return 0;
}