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

Treats for the Cows
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 5191 Accepted: 2712
Description

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.
Source

USACO 2006 February Gold & Silver

#include "cstring"
#include "cstdio"
#include "iostream"
#include "string.h"
#include "algorithm"
using namespace std;
int v[2005];
int dp[2005][2005];
int main()
{
int n;
while(~scanf("%d",&n))
{
for(int i=1;i<=n;i++)
scanf("%d",&v[i]);
memset(dp,0,sizeof(dp));
for(int len=1;len<=n;len++)
{
for(int i=1;i+len-1<=n;i++)
{
int cnt=n-len+1;
dp[i][i+len-1]=max(dp[i][i+len-2]+v[i+len-1]*cnt,dp[i+1][i+len-1]+v[i]*cnt);
}
}
printf("%d\n",dp[1][n]);
}
}

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

## 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
• 989

## poj 3186 Treats for the Cows （区间dp）

Treats for the Cows Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 646...
• qq_30591245
• 2017年08月27日 12:36
• 71

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

the question is here this DP question want us to chose treats and find the maximum value . We can s...
• lingzidong
• 2017年05月27日 19:06
• 88

## Poj 3186 Treats for the Cows【区间dp】

Treats for the Cows Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 542...
• mengxiang000000
• 2017年01月22日 20:57
• 428

## 【POJ 3186 】Treats for the Cows （区间DP）

• u013611908
• 2015年01月25日 16:32
• 689

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

• swust_Three
• 2017年04月16日 16:22
• 156

## poj 3186 Treats for the Cows （区间DP）

DescriptionFJ has purchased N (1
• hndu__lz
• 2016年08月12日 13:58
• 147

## POJ 3186 Treats for the Cows（区间DP）

• azx736420641
• 2015年02月13日 20:57
• 231

## POJ 3186 Treats for the Cows （区间DP）

• Robincin_S
• 2015年10月09日 14:39
• 231

## poj 3186 Treats for the Cows (区间dp)

• My_ACM_Dream
• 2014年12月01日 10:58
• 323

举报原因： 您举报文章：POJ 3186 Treats for the Cows (区间DP) 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)