POJ 3186 Treats for the Cows (DP)

//#pragma commmpnt(linkmpr, "/STACK:102400000,102400000")
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <queue>
using namespace std;
typedef long long LL;
const int M = 100010;
const int INF =0x3f3f3f3f;
const int MAXN=50010;

int dp[2050][2050];
int a[2050];

int main()
{
int n;
cin>>n;
for(int i=1;i<=n;++i)
{
cin>>a[i];
}
memset(dp,0,sizeof(dp));

for(int i=n;i>=1;--i)
{
for(int j=i;j<=n;++j)
{
dp[i][j]=max(dp[i][j],dp[i+1][j]+(n-(j-i))*a[i]);
dp[i][j]=max(dp[i][j],dp[i][j-1]+(n-(j-i))*a[j]);
}
}

cout<<dp[1]
<<endl;

return 0;
}