[USACO06FEB]Treats for the Cows G/S奶牛零食（区间dp）

洛谷

acwing

#include <bits/stdc++.h>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <set>
#define x first
#define y second
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;

typedef pair<int,int> PII;
typedef pair<char,int> PCI;
typedef long long LL;
typedef __int128 i128;
typedef unsigned long long ULL;
const int N=2000+10,p=131;
const LL INF = 1e16;
const double eps = 1e-7;


int a[N],f[N][N];
int n;

void solve()
{
    cin>>n;
    for(int i=1;i<=n;i ++ ) cin >> a[i];
    
    for(int len=1;len<=n;len++)
    for(int l=1,r=l+len-1;r<=n;l++,r++)
    {
        int now= n -(r-l);
        // 当前进行到 第几步了 , 左边用掉了l个，右边用掉了 n-r个 
        f[l][r] = max(f[l+1][r] +now*a[l],f[l][r-1]+ now*a[r] );
    }
    
            
    cout << f[1][n] << endl;        
}
int main()
{
    ios 
    LL T=1;
//     cin>>T;
    while(T -- )
    {
        solve();
    }    
    
    
    
    
    return 0;
}