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.

Input

Line 1: A single integer, N 

Lines 2..N+1: Line i+1 contains the value of treat v(i)

Output

Line 1: The maximum revenue FJ can achieve by selling the treats

Sample Input

5
1
3
1
5
2

Sample Output

43

Hint

Explanation of the sample: 

Five treats. On the first day FJ can sell either treat #1 (value 1) or treat #5 (value 2). 

FJ sells the treats (values 1, 3, 1, 5, 2) in the following order of indices: 1, 5, 2, 3, 4, making 1x1 + 2x2 + 3x3 + 4x1 + 5x5 = 43.

题目刚开始没看懂，后来才yy明白是一个双向队列，每次只能从两端出来元素，出来的元素 * 出来的次序  累加得到sum， 让我们求sum的最大值。

思路：

区间dp，考虑[i, j]这一段，假设其他的都还没拿出来，那么[i, j] 一定由 [i + 1, j] 或者 [i, j - 1] 推得
dp[i][j] = max(dp[i + 1][j] + v[i] * (n - (j - i)), dp[i][j - 1] + v[j] * (n - (j - i))).

上代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int dp[2010][2010];
int ans[2010];
int main()
{
    int n;
    scanf("%d", &n);
    memset(dp, 0, sizeof(dp));
    for(int i=1; i<=n; ++i)
    {
        scanf("%d", &ans[i]);
    }
    for(int i=n; i>=1; --i) // 这边注意是逆序，动态规划的无后效性.
    {
        for(int j=i; j<=n; j++)
        dp[i][j] = max(dp[i+1][j]+ ans[i]*(n-j+i) ,dp[i][j-1] + ans[j]*(n-j+i));
    }
    cout << dp[1][n] << endl;
    return 0;
}

水波。