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
Input
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.
Output
Print a single integer — the number of ways to split the array into three parts with the same sum.
Examples
input
5 1 2 3 0 3output
2input
4 0 1 -1 0output
1input
2 4 1output
0
题目大意:要把长度为n的数组分为连续的3组,即找到两个断点。
我们先找到他的前缀和,若所有和不是3的倍数,则不可能满足题意。
在前缀和中有三种比较特别的点。
- 第一种是:前缀和为:sum[n]/3.
- 第二个点:前缀和为:2 * sum[n]/3,此时若在该点钱存在1个前缀和为sum[n]/3的点,我们就可以得到1个答案满足的组合,若有两个则可以找到两个组合。
- 第三个点:前缀和为sum[n]。即最后一个点。
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i = a;i <= b;++i)
#define per(i,a,b) for(int i = a;i >= b;--i)
#define int long long
using namespace std;
const int N =5e5+10;
int a[N],sum[N];
signed main() {
int n; cin >> n;
rep(i,1,n) cin >> a[i],sum[i] = sum[i-1] + a[i];
if(sum[n] % 3 != 0){
cout << 0 << endl;
return 0;
}
int ans = 0,t = 0;
rep(i,1,n){
if(i > 1 and i < n and sum[i] * 3 == sum[n] * 2) ans += t;
if(sum[i] * 3 == sum[n]) t ++;
}
cout << ans << endl;
}