[ poj 3616] Milking Time [ DP ]
来源:互联网 发布:冷烟花在淘宝上怎么买 编辑:程序博客网 时间:2024/05/16 05:03
Bessie is such a hard-working cow. In fact, she is so focused on maximizing her productivity that she decides to schedule her next N (1 ≤ N ≤ 1,000,000) hours (conveniently labeled 0..N-1) so that she produces as much milk as possible.
Farmer John has a list of M (1 ≤ M ≤ 1,000) possibly overlapping intervals in which he is available for milking. Each interval i has a starting hour (0 ≤ starting_houri ≤ N), an ending hour (starting_houri < ending_houri ≤ N), and a corresponding efficiency (1 ≤ efficiencyi ≤ 1,000,000) which indicates how many gallons of milk that he can get out of Bessie in that interval. Farmer John starts and stops milking at the beginning of the starting hour and ending hour, respectively. When being milked, Bessie must be milked through an entire interval.
Even Bessie has her limitations, though. After being milked during any interval, she must rest R (1 ≤ R ≤ N) hours before she can start milking again. Given Farmer Johns list of intervals, determine the maximum amount of milk that Bessie can produce in the N hours.
Input
* Line 1: Three space-separated integers: N, M, and R
* Lines 2..M+1: Line i+1 describes FJ’s ith milking interval withthree space-separated integers: starting_houri , ending_houri , and efficiencyi
Output
* Line 1: The maximum number of gallons of milk that Bessie can product in the N hours
Sample Input
12 4 2
1 2 8
10 12 19
3 6 24
7 10 31
看代码罢,不是很难。
代码
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int MAXN =1e3+10;const int MAXM =1e6+100;const int inf = 0x3f3f3f3f;struct Hour{ int st,ed,eff;}hour[MAXN];bool cmp(Hour a,Hour b){ if(a.ed!=b.ed) return a.ed<b.ed; return a.st<b.st;}int dp[MAXN];int main(){ int n,m,r; while(~scanf("%d%d%d",&n,&m,&r)){ for(int i=1;i<=m;i++){ scanf("%d%d%d",&hour[i].st,&hour[i].ed,&hour[i].eff); } sort(hour+1,hour+1+m,cmp); /*for(int i=1;i<=m;i++){ printf("%d %d %d \n",hour[i].st,hour[i].ed,hour[i].eff); }*/ int maxval=-1; for(int i=1;i<=m;i++){ //if(hour[i].ed-r>n) break; dp[i]=hour[i].eff; for(int j=1;j<i;j++){ if(hour[j].ed+r<=hour[i].st) dp[i]=max(dp[j]+hour[i].eff,dp[i]); else // 其实这个else也没有用,因为当前的maxval存的就是以j为为末尾的最大值 dp[i]=max(dp[i],dp[j]); } maxval=max(maxval,dp[i]); } printf("%d\n",maxval); } return 0;}
- poj 3616 Milking Time DP
- POJ 3616 Milking Time DP
- poj-3616 Milking Time 【DP】
- poj 3616 Milking Time DP
- DP-POJ-3616-Milking Time
- poj 3616 Milking Time 【dp】
- [POJ 3616]Milking Time[DP]
- Poj 3616 Milking Time【dp】
- POJ - 3616 Milking Time(Dp)
- POJ 3616 Milking Time (DP)
- poj 3616 Milking Time (DP)
- [ poj 3616] Milking Time [ DP ]
- POJ 3616 Milking Time(简单DP)
- POJ 3616-Milking Time (基础DP)
- POJ 3616 Milking Time DP题解
- POJ 3616 Milking Time DP题解
- poj 3616 Milking Time dp+树状数组
- POJ 3616 Milking Time (dp)
- POJ 2.5 8783 && luogu p1019 单词接龙
- 文件和目录
- 前端面试题目合集
- hdu1159 最大公共子序列(lcs) hdu 1080
- ng2学习——简单后台demo的实现
- [ poj 3616] Milking Time [ DP ]
- BOOST库 之 string_algo 字符串的增删改查
- mysql
- greenDao的简单使用教程
- LintCode407
- 【矩阵快速幂】HDU_4565_So Easy!
- 容斥原理
- Python相对导入问题
- C陷阱与缺陷