POJ--3186--Treats for the Cows

题目描述：
FJ has purchased N (1 <= N <= 2000) yummy treats for the cows who get money for giving vast amounts of milk. FJ sells one treat per day and wants to maximize the money he receives over a given period time.
The treats are interesting for many reasons:
The treats are numbered 1…N and stored sequentially in single file in a long box that is open at both ends. On any day, FJ can retrieve one treat from either end of his stash of treats.
Like fine wines and delicious cheeses, the treats improve with age and command greater prices.
The treats are not uniform: some are better and have higher intrinsic value. Treat i has value v(i) (1 <= v(i) <= 1000).
Cows pay more for treats that have aged longer: a cow will pay v(i)*a for a treat of age a.
Given the values v(i) of each of the treats lined up in order of the index i in their box, what is the greatest value FJ can receive for them if he orders their sale optimally?

The first treat is sold on day 1 and has age a=1. Each subsequent day increases the age by 1.
输入描述:
Line 1: A single integer, N
Lines 2…N+1: Line i+1 contains the value of treat v(i)
输出描述:
Line 1: The maximum revenue FJ can achieve by selling the treats
输入：
5
1
3
1
5
2
输出：
43
题意：
给你n个数字v(1),v(2),…,v(n-1),v(n)，每次你可以取出最左端的数字或者取出最右端的数字，一共取n次取完。假设你第i次取的数字是x，你可以获得i*x的价值。你需要规划取数顺序，使获得的总价值之和最大。
题解：
区间dp
dp[i][j]表示从i到j的取的最大值
要么取i+1要么取j-1
代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;

const int maxn = 2000 + 5;
int a[maxn];
int dp[maxn][maxn];

int main(){
    int n;
    while(scanf("%d",&n)!=EOF){
        memset(dp,0,sizeof(dp));
        for(int i = 1; i <= n; i ++) scanf("%d",&a[i]);
        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]);
            }
        }
        printf("%d\n",dp[1][n]);
    }
    return 0;
}