P2858 [USACO06FEB]Treats for the Cows G/Shttps://www.luogu.com.cn/problem/P2858
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <unordered_map>
#include <cmath>
#include <map>
#include <cctype>
#include <cstdlib>
#include <deque>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))
int n;
int s[MAXN];
int f[2005][2005];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", s + i);
f[i][i] = s[i] * n;
}
for (int l = 1; l < n; l++) {
for (int i = 1; i <= n - l; i++) {
int j = i + l;
f[i][j] = max(f[i + 1][j] + s[i] * (n - l), f[i][j - 1] + s[j] * (n - l));
}
}
printf("%d\n", f[1][n]);
return 0;
}