POJ3186 Treats for the Cows DP
2015-12-02 20:00
253 查看
Treats for the Cows
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uDescription
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, NLines 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 treatsSample Input
51
3
1
5
2
Sample Output
43题解:
给出的一系列的数字,可以看成一个双向队列,每次只能从队首或者队尾出队,第n个出队就拿这个数乘以n,最后将和加起来,求最大和
代码
#include<iostream> #include<cstring> #include<cstdio> #include<cmath> #include<algorithm> using namespace std; int dp[2005][2005]; int a[2005]; int main() { int n; while(~scanf("%d",&n)){ memset(dp,0,sizeof(dp)); for (int i = 1;i<=n;i++) { scanf("%d",&a[i]); } for (int i = 1;i<=n;i++) dp[i][i] = a[i]*n; int j; for (int k = 1;k<n;k++) { for (int i = 1;k+i<=n;i++) { j = i+k; dp[i][j] = max(dp[i+1][j]+(n-k)*a[i],dp[i][j-1]+(n-k)*a[j]); } } printf("%d\n",dp[1] ); } }
相关文章推荐
- 给于 dom 解析的跳转框架
- 文章标题
- hibernate连接数据库,进行操作的步骤
- PCL—低层次视觉—点云分割(超体聚类)
- DataGrid( 数据表格) 组件[2]
- FMDB简单介绍
- 1046. Shortest Distance (20)
- 南大软院大神养成计划——第十七天
- 聚合分析:二进制计数器
- TortoiseSVN SPREADSHEET COMPARE 比较表格
- HDU 4545-魔法串-字符串
- jade模板引擎(一)
- ASP.NET login控件
- 编译原理(九) LR(0)文法分析法(算法描述和C++代码实现)
- Leetcode题解(五)
- 杭电校赛(游乐场)
- C语言_指针函数
- <拦截>所有调用某方法的地方--黑魔法
- 计算机如何表示浮点数(小数)
- windows复制文件到Linux或Windows,有关FTP的配置与使用