dp poj3186

原创 2016年06月01日 20:39:33
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.

这个地方的动态转移直接转移不好办 所以我们要想办法把这个过程逆向进行 也就是从0个元素开始不停地往里面添加元素  可以从左边添加也可以从右边添加 但是权值是由大到小的 这个地方要注意 dp[i][j]表示从i到j的最大的取值
状态转移方程 dp[i][j]=max(dp[i][j-1]+(n+i-j)*arr[j],dp[i+1][j]+(n+i-j)*arr[i]); 然后所有的全部初始化为 0 直接转移就可以啦 其实还是很好办的 !




#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;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

poj3186Treats for the Cows(区间DP)

Description FJ has purchased N (1 The treats are interesting for many reasons: The treats ...

每日三题-Day5-B(POJ 3186 Treats for the Cows 区间DP)

Treats for the Cows Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 587...

POJ 3186 Treats for the Cows (区间DP)

题意:给你  n 个数字,类似于双端队列,每次只能取首尾的数字,对于第 i 次取得的数字的价值为 i*a[k] ,求取完这 n 个数字最多能得到多少价值。 很有意思的一个题,先考虑贪心,因为...

poj 3186 Treats for the Cows(DP)

yyf屁颠儿屁颠儿地跟我说他找了一个水DP,看他现在还没有A掉,其实也没那么水,哈?! 刚开始他的想法是从两头比较,价钱低的那个先卖出去,价钱高的留在后面。但是这样的话如果价钱相同就不知道怎么办了。 ...

poj 3186 Treats for the Cows (区间dp)

给出n个数,形成一个队列,每个数可以从队首和对尾出来,第k个数来的数的价值等于这个数本身的值*k,问怎么样出队,能让中和最大。 状态返程: dp[i][j] = max { dp[I+1]j] + a...

poj 3186 Treats for the Cows(区间dp)

Treats for the Cows Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 428...

poj3186——Treats for the Cows(区间dp)

DescriptionFJ has purchased N (1

POJ 3186 Treats for the Cows(区间dp)

Treats for the Cows Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 618...

POJ3186【区间DP】

题意: 每次只能取两端,然后第 i 次取要val[ i ]*i,求一个最大值 先将错觉吧 这道题目一开始想的就是记忆化搜索,然后太天真了?好像是,一开始用一维dp[ i ]直接代表一个点的最大。...

POJ-3186 Treats for the Cows (区间DP)

Description FJ has purchased N (1
  • robin_8
  • robin_8
  • 2017年01月22日 21:15
  • 65
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:dp poj3186
举报原因:
原因补充:

(最多只允许输入30个字)