reference

• T6 分糖果

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

const int N = 1e6+5;
int a[N], t, n;
long long sumi, sumj, ti, tj;
int cnt=1;

int main() {
    cin >> n;
    for (int i=1; i<=n; i++) cin>>a[i];

    int i=1, j=n; 
    while (i <= j){
        if (cnt%2==1){
            while (ti <= tj && i<=j) ti += a[i++];

            sumi += ti;
            tj = 0;
        }
        else{
            while (tj <= ti && i<=j) tj += a[j--];
            sumj += tj;
            ti = 0;
        }
        cnt++;
    }
    printf("%d %lld %lld\n", cnt-1, sumi, sumj);

    return 0;
}

• T7
  

• T8 餐馆点餐