Treats for the Cows -dp

【题目】

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 <br> <br>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的序列，每次从队首或队尾取数，第i次取出的数的权值为数*i，求取完整个序列的最大权值

思路：

dp[ i ] [ j ] 代表从左边取了i个数，从右边取了j个数

则：dp[i][j] = max(dp[i-1][j] + a[i]* (i+j), dp[i][j-1] + a[n-j+1]*(i+j));

注意当 i j 为0的边界判断即可

代码：

#include<iostream>
#include<cstring>
#include<cmath>
#include<cstdio>
#define N 2001
using namespace std;
int a[N];
int dp[N][N],n;
int main()
{
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>a[i];
    for(int i=0;i<=n;i++)
    {
        for(int j=0;j+i<=n;j++)
        {
            if(i==0&&j==0)
                dp[i][j]=0;
            else if(i==0)
                dp[i][j]=dp[i][j-1] + a[n-j+1]*(i+j);
            else if(j==0)
                dp[i][j]=dp[i-1][j] + a[i]*(i+j);
            else
                dp[i][j] = max(dp[i-1][j] + a[i]*(i+j),dp[i][j-1] + a[n-j+1]*(i+j));
        }
    }
    int ans=-1;
    for(int i=0;i<=n;i++)
        ans=max(ans,dp[i][n-i]);
    cout<<ans<<endl;
    return 0;
}