# dp poj3186

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.

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <sstream>
#include <ostream>
#include <list>
#include <ctype.h>
#include <cmath>
#define inf 2000000007
using namespace std;
int dp[2002][2002];
int arr[2002];
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
cin>>arr[i];
for(int i=n;i>=1;i--)
{
for(int j=i;j<=n;j++)
{
dp[i][j]=max(dp[i+1][j]+(n+i-j)*arr[i],dp[i][j-1]+(n+i-j)*arr[j]);
}
}
cout<<dp[1][n]<<endl;
}

• 本文已收录于以下专栏：

## poj3186 dp

/************************************************ *Author :jibancanyang *Created Time :二 ...
• jibancanyang
• 2016年04月07日 09:52
• 145

## poj3186解题报告

• h123120
• 2015年07月11日 17:08
• 700

## POJ3186迷之DP

• NineFailure
• 2016年08月01日 20:18
• 171

## POJ3186 Treats for the Cows DP

Treats for the CowsTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uDescr...
• qq_21057881
• 2015年12月02日 20:00
• 254

## POJ3186

Treats for the rows 题意：给一个数组，然后只能把数组两端的数取出来，然后乘以这是第几次取出的数，然后相加，问取完之后，最大的值为多少？ 思路：用一个二位dp数组，dp[i]...
• xiaolonggezte
• 2017年03月31日 11:15
• 156

## poj3186Treats for the Cows(区间DP)

Description FJ has purchased N (1 The treats are interesting for many reasons: The treats ...
• u010372095
• 2014年07月21日 20:43
• 985

## poj3186

• fouzhe
• 2016年07月20日 20:52
• 178

## poj3186(递推)

• stay_accept
• 2016年05月27日 17:28
• 275

## POJ3186【区间DP】

• KEYboarderQQ
• 2016年07月11日 10:24
• 197

## poj3186（记忆化搜索）

FJ has purchased N (1
• T__TSZ
• 2017年11月24日 15:02
• 39

举报原因： 您举报文章：dp poj3186 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)