Deltix Round, Summer 2021 (open for everyone, rated, Div. 1 + Div. 2)--C. Compressed Bracket Sequenc

AC代码

#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 10005;
ll a[N];
int main() {
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    ll ans = 0;
    for (int i = 1; i <= n; i += 2) {
        ll x = 0, y = 0;
        for (int j = i + 1; j <= n; j += 2) {
            if (j == i + 1)
                ans += max(0ll, min(a[i], a[j]));   
            else
                ans += max(0ll, min(a[i] + y + 1, a[j] - x + y + 1));
            x -= a[j];
            y = min(x, y);
            x += a[j + 1];
            cout<<ans<<endl;
        }
    }
    cout << ans << endl;
}