P2426 删数 ( 区间dp

#include <bits/stdc++.h>
using namespace std;
using VI = vector<int>;
using PII = pair<int,int>;
using ll = long long;
using ull = unsigned long long;




int a[3010];
int f[110][110];
int n,m,k;
int main(){
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        f[i][i] = a[i];
    }

    for(int len=2;len<=n;len++){
        for(int i=1;i+len-1<=n;i++){
            int j = i + len - 1;
            f[i][j] = abs(a[j] - a[i]) * len;
            for(int k=i;k<j;k++){
                //int t = max(abs(a[k]-a[i]) * (k-i+1),abs(a[j]-a[k+1]) * (j-k));
                f[i][j] = max(f[i][j] , f[i][k] + f[k+1][j]);
            }
        }
    }

    cout<<f[1][n];
}

从删除区间考虑成生成区间

f[i][j]    得由发f[i][k]  + f[k+1][j] 生成  ，还有直接生成f[i][j]