POJ3616 Milking Time DP
来源:互联网 发布:js获取url页面内容 编辑:程序博客网 时间:2024/05/16 23:50
Milking Time
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
Description
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
Sample Output
43
题解:
先按照奶牛的开始工作时间排序,dp[i]表示从0到i的最大收益,那么dp[i] =max(dp[i],dp[j]+cow[i].effic);
代码
#include <iostream>#include<cstring>#include<cmath>#include<algorithm>#include<cstdio>using namespace std;int dp[1000005];struct milk{ int start_hour; int end_hour; int effic;}cow[1001];bool cmp(milk a,milk b){ return a.start_hour < b.start_hour;}int main(){ int n,m,r; scanf("%d%d%d",&n,&m,&r); for (int i = 0;i<m;i++) { scanf("%d%d%d",&cow[i].start_hour,&cow[i].end_hour,&cow[i].effic); cow[i].end_hour+=r; //加上休息时间 } sort(cow,cow+m,cmp); for (int i = 0;i<m;i++) { dp[i] = cow[i].effic; for (int j = 0;j<i;j++) if (cow[i].start_hour >= cow[j].end_hour) dp[i] = max(dp[i],dp[j]+cow[i].effic); } int maxn = 0; for (int i = 0;i<m;i++) if (dp[i] > maxn) maxn = dp[i]; printf("%d\n",maxn); return 0;}
- POJ3616 Milking Time 【DP】
- POJ3616 Milking Time DP
- POJ3616 Milking Time (dp)
- poj3616 Milking Time 入门dp
- POJ3616 MILKING TIME
- poj3616 Milking Time
- POJ3616---Milking Time
- POJ3616:Milking Time
- poj3616 Milking time
- POJ3616-Milking Time
- POJ3616-Milking Time
- poj3616 Milking Time
- POJ3616 Milking Time(DP:最大子段和)
- poj3616——Milking Time(dp最大子序列)
- POJ3616 Milking Time 动态规划
- poj3616 Milking Time(动态规划)
- POJ3616——Milking Time
- POJ3616-递推-Milking Time
- 精通javascript study
- maven项目,代码正确的情况下,整个项目中的类报cannot be resolved to a type
- Android Studio 乱码问题
- QT Rectanle 类型解析
- 【Leetcode】Best Time to Buy and Sell Stock II
- POJ3616 Milking Time DP
- Android Studo代码提示快捷键(java和xml布局中都能出现提示)
- 对抗拖库 —— Web 前端慢加密
- MAC 设置环境变量path的几种方法
- WebKit(刷新)
- 新浪微博项目之新特性界面
- cv::Mat到YUV420的转换
- 正则表达式
- Android——遇故障时重启应用