poj 3186 Treats for the Cows (区间dp)

给出n个数，形成一个队列，每个数可以从队首和对尾出来，第k个数来的数的价值等于这个数本身的值*k，问怎么样出队，能让中和最大。

状态方程：

dp[i][j] = max { dp[I+1]j] + a[i]*(L-i+1) , dp[i][j-1] + a[j]*(L-i+1) }  可以认为除了这个区间，以外的数都出队了，那么现在出队的序号就是L-i+1; L是枚举的长度，i是起点

#include<iostream>
#include<math.h>
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<string>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<stack>
#define B(x) (1<<(x))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned ui;
const int oo = 0x3f3f3f3f;
//const ll OO = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-9;
#define lson rt<<1
#define rson rt<<1|1
void cmax(int& a, int b){ if (b > a)a = b; }
void cmin(int& a, int b){ if (b < a)a = b; }
void cmax(ll& a, ll b){ if (b > a)a = b; }
void cmin(ll& a, ll b){ if (b < a)a = b; }
void cmax(double& a, double b){ if (a - b < eps) a = b; }
void cmin(double& a, double b){ if (b - a < eps) a = b; }
void add(int& a, int b, int mod){ a = (a + b) % mod; }
void add(ll& a, ll b, ll mod){ a = (a + b) % mod; }
const ll MOD = 1000000007;
const int maxn = 2100;
int dp[maxn][maxn];
int a[maxn];

int main(){
	int n;
	while (scanf("%d", &n) != EOF){
		for (int i = 1; i <= n; i++)scanf("%d", &a[i]);
		memset(dp, 0, sizeof dp);
		for (int i = 1; i <= n; i++) dp[i][i] = a[i] * n;
		for (int L = 2; L <= n; L++){
			for (int i = 1; i + L - 1 <= n; i++){
				int j = i + L - 1;
				dp[i][j] = max(dp[i + 1][j] + a[i] * (n - L + 1), dp[i][j - 1] + a[j] * (n - L + 1));
			}
		}
		printf("%d\n", dp[1][n]);
	}
	return 0;
}