dp poj3186
来源:互联网 发布:网络证券交易平台 编辑:程序博客网 时间:2024/06/11 06:00
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 first treat is sold on day 1 and has age a=1. Each subsequent day increases the age by 1.
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.
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)
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
513152
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.
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 2000000007using 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;}
0 0
- poj3186 dp
- dp poj3186
- POJ3186【区间DP】
- POJ3186迷之DP
- poj3186(区间dp)
- poj3186
- POJ3186
- POJ3186:Treats for the Cows(区间DP)
- POJ3186:Treats for the Cows 区间DP
- POJ3186 Treats for the Cows DP
- POJ3186:Treats for the Cows(区间DP)
- POJ3186:Treats for the Cows(区间DP)
- poj3186(搜索)
- 区间dp入门[POJ2955][HDU2476][POJ3186][POJ1651][HDU4632][HDU4283][HDU4570][POJ3280]
- poj3186解题报告
- poj3186(递推)
- POJ3186+3190+3250
- POJ3186:Treats for the Cows
- 运动目标检测--帧间差分法
- Android避免反复弹出同一Toast
- HDU 1214
- 玩转AppBarLayout,更酷炫的顶部栏
- 天池大数据比赛-菜鸟仓库比赛-第二赛季记录
- dp poj3186
- 渲染流水线
- java synchronized关键字
- 天池大数据比赛,菜鸟仓库比赛,御膳房操作
- 经典计算机视觉论文笔记——《Robust Real-Time Face Detection》
- Read Phone Number
- 同时加载执行多个js函数addLoadEvent()
- css部分细节(持续更新)
- Poj1228 Grandpa's Estate