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.

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.

题目大意：一个两端取得队列，每个物品的权值为它本身的价值乘以他是第几个被取的（时间），求所有物品权值之和最大

博客链接：https://www.cnblogs.com/wuwangchuxin0924/p/6561922.html

解题思路：大致的上面链接里有些，这是我第一次遇到区间dp问题，简要说一下区间dp是什么样的问题，就是对于每一个区间，求它的最大值（最小值。。。），然后一点一点网外扩，每一个大区间，都用它刚刚算出来的上一个嵌套在它里面的小区间，个人看法。。。

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <math.h>
#define inf 0x3f3f3f3f
int a[3000],dp[3000][3000];
using namespace std;
int main()
{
    int n,i,j;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
        dp[i][i]=a[i]*n;
    }
    for(i=n-1;i>=1;i--)
    {
        for(j=i+1;j<=n;j++)
        {
            dp[i][j]=max(dp[i+1][j]+a[i]*(n-j+i),dp[i][j-1]+a[j]*(n-j+i));
        }
    }
    printf("%d\n",dp[1][n]);
    return 0;
}