截断数组——Acwing3956

#include <iostream>

using namespace std;

typedef long long LL;

const int N = 100010;

int n;
int a[N], s[N];

int main()
{
    scanf("%d", &n);
    for (int i = 1; i <= n; i ++ ) scanf("%d", &a[i]);
    for (int i = 1; i <= n; i ++ ) s[i] = s[i - 1] + a[i];

    LL res = 0;
    for (int i = 3, cnt = 0; i <= n; i ++ ) 
    {
        if (s[n] % 3) 
        {
            puts("0");
            return 0;   
        }
        else
        {
            if (s[i - 2] == s[n] / 3) cnt ++ ;
            if (s[n] - s[i - 1] == s[n] / 3) res += cnt;
        }
    }
    cout << res << endl;

    return 0;
}