Acwing6118 蛋糕游戏

这是yxc大佬的题解，这道题的推导很有意思，但是结论很简单，就是用前缀和找中间一段累加最小的连续数组。唉是我一辈子做不出的题。

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

typedef long long LL;
const int N = 500010;

int n;
LL s[N];

int main()
{
    int T;
    scanf("%d", &T);

    while (T -- )
    {
        scanf("%d", &n);

        LL a = 1e15;
        int l = n / 2 + 1;
        for (int i = 1; i <= n; i ++ )
        {
            int x;
            scanf("%d", &x);
            s[i] = s[i - 1] + x;
            if (i >= l) a = min(a, s[i] - s[i - l]);
        }

        printf("%lld %lld\n", a, s[n] - a);
    }

    return 0;
}