poj 3186 Treats for the Cows （区间dp）

Treats for the Cows Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 6468   Accepted: 3390 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 /** 逆推思想。。。由本来的由两边向内收缩转化为为由内向外扩展 和上下山问题一样转换思维方式 dp[i][j]=max(dp[i+1][j],dp[i][j-1])+(day)*val[i]|val[j] 因为是逆推 所以取得时间天数等于n - 时间间隔 **/ #include<algorithm> #include<string.h> #include<stdio.h> #include<vector> using namespace std; int dp[2003][2003]; int val[10003]; int main() { int n; while(~scanf("%d",&n)) { memset(dp,0,sizeof(dp)); memset(val,0,sizeof(val)); for(int i=1;i<=n;i++) { scanf("%d",&val[i]); } for(int i=1;i<=n;i++) dp[i][i]=val[i]*n; for(int d=1;d<n;d++)///时间间隔 { for(int i=1;i+d<=n;i++) { int j=i+d; dp[i][j]=max(dp[i+1][j]+(n-d)*val[i],dp[i][j-1]+(n-d)*val[j]); } } printf("%d\n",dp[1][n]); } }