Codeforces Deltix Round Summer 2021 [Div.1 + Div.2] C题

对于这题我的思路是类似区间dp的一种算法
开了一个结构体，对于f[i] [j]
w==1 表示在i到j这个区间内除掉边缘序列， 剩下的是一个合法序列
l表示左边多余的’(’
r 表示右边多余的’)’
例如"((())"
此时 w=1,l=1, r=0;

#include<iostream>
#include <cstdio>
#include <algorithm>
#include<cmath>
#include <iterator>
#include <cstring>
#include <string>
#include <map>
#include <queue>
#include <vector>
#include <stack>
#include "set"
#include "sstream"
#define LL long long
using namespace std;
const int N = 2000100;
LL t,n,a[100100],ans;
struct node {
    LL w,l,r;
}f[1100][1100];
int main() {
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= n; i += 2) {//先计算长度为二的序列
        f[i][i + 1].w = 1;
        ans+=min(a[i],a[i+1]);
        if (a[i] >= a[i + 1]) f[i][i + 1].l = a[i] - a[i + 1];
        else f[i][i + 1].r = a[i + 1] - a[i];
    }
    for (int len = 4; len <= n; len +=2)
        for (int i = 1; i + len - 1 <= n; i += 2) {
            int j = i + len - 1;
            for (int k = i + 1; k + 1 < j; k += 2) {
            if (f[i][k].r || f[k + 1][j].l || !f[i][k].w || !f[k + 1][j].w) continue;
            f[i][j].w=1;
            ans+=min(f[i][k].l,f[k+1][j].r)+1;//每次要多加一个
            if (f[i][k].l > f[k + 1][j].r) f[i][j].l = f[i][k].l - f[k + 1][j].r;
            else f[i][j].r = f[k + 1][j].r - f[i][k].l;
            break;
        }
        }
    cout << ans;
    return 0;
}