题意:一个长度小于等于2000的数组a,每次可以再头部或尾部取数,ai为第k个取的数,则需要花费k*ai的代价,求取完数的最大代价。
题解:dp[i][j]表示前面取了a[0~i],后面取了a[j~n+1]的最大代价,很明显,dp[i][j]只与dp[i-1][j]或者dp[i][j+1]有关。
代码:
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
// #define int long long
using namespace std;
const int N = 2e3 + 10;
const int INF = 1e9;
int n, a[N];
int dp[N][N];
signed main() {
cin >> n;
int i, j;
for (i = 1; i <= n; i++) cin >> a[i];
for (i = 1; i <= n; i++) dp[i][n + 1] = dp[i - 1][n + 1] + i * a[i];
for (j = n; j >= 1; j--) dp[0][j] = dp[0][j + 1] + (n - j + 1) * a[j];
for (i = 1; i <= n; i++) {
for (j = n; j > i; j--) {
int k = i + (n - j + 1);
dp[i][j] = max(dp[i - 1][j] + k * a[i], dp[i][j + 1] + k * a[j]);
}
}
int ans = 0;
for (i = 0; i <= n; i++) ans = max(ans, dp[i][i + 1]);
cout << ans << endl;
return 0;
}
/*
input:::
5
1 3 1 5 2
output:::
43
*/