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
Copy
5 1 2 3 0 3
output
Copy
2
input
Copy
4 0 1 -1 0
output
Copy
1
input
Copy
2 4 1
output
Copy
0
题目大致意思:找两个点,将数组分成和相等的三段。
考点:前缀和。
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl "\n"
const ll N = 5e5+7;
ll n,m;
ll v[N];
void solve(){
cin >> n;
for(ll i = 1 ; i <= n ; i ++)
cin >> v[i] ,v[i]+=v[i-1];
ll sum=0,c=0;
for(ll i = 1 ; i < n ; i ++){
if(v[i]*3 == v[n]*2)sum+=c;
if(v[i]*3 == v[n])c++;
}
cout << sum << endl;
return;
}
int main(){
ll t=1;//cin >> t;
while(t--)solve();
return 0;
}