18焦作Distance

传送门
规律

#include <bits/stdc++.h>
using namespace std;

int main(){
    int t, n;
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> t;
    while(t--){
        cin >> n;
        vector<int> vt(n-1);
        vector<long long> vtl(n);
        for(auto &i : vt) {
            cin >> i;
        }
        for(int i = 1; i < vtl.size(); ++i) {
            vtl[i] = vtl[i-1] + vt[i-1];
        }
        long long last = 0, ans = 0;
        int cnt = 1;
        int l = -1, r = n;
        while(l < r) {
            if(cnt&1) {
                ++l;
                if(l == r) {
                    break;
                }
                ans += last;
            } else {
                --r;
                if(l == r) {
                    break;
                }
                last += vtl[r]-vtl[l];
                ans += last;
            }
            if(cnt != 1) cout << ' ';
//            cout << "[l:" << l << ",r:" << r << "] ";
            cout << ans;
            ++cnt;
        }
        cout << endl;
    }
    return 0;
}