poj3616——Milking Time(dp最大子序列)
来源:互联网 发布:众泰和知豆哪个好 编辑:程序博客网 时间:2024/06/06 03:35
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
给定一个时间段,在给出一些间隔,母牛会在这些间隔内产奶,求选择合适的间隔来使得产奶量最大。
#include <iostream>#include <cstring>#include <string>#include <vector>#include <queue>#include <cstdio>#include <set>#include <cmath>#include <map>#include <algorithm>#define INF 0x3f3f3f3f#define MAXN 1000010#define Mod 10001using namespace std;struct Node{ int x,y,sum;};Node a[MAXN];bool cmp(Node a,Node b){ if(a.x==b.x) return a.y<b.y; return a.x<b.x;}int dp[MAXN];int main(){ int n,m,p; while(~scanf("%d%d%d",&n,&m,&p)) { memset(dp,0,sizeof(dp)); for(int i=1;i<=m;++i) { scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].sum); a[i].y+=p; } sort(a+1,a+m+1,cmp); for(int i=m;i>0;--i) { dp[i]=a[i].sum; for(int j=i+1;j<=m;++j) { if(a[j].x>=a[i].y) dp[i]=max(dp[i],dp[j]+a[i].sum); } } int ans=-INF; for(int i=1;i<=m;++i) ans=max(ans,dp[i]); printf("%d\n",ans); } return 0;}
- poj3616——Milking Time(dp最大子序列)
- POJ3616 Milking Time(DP:最大子段和)
- POJ3616 Milking Time 【DP】
- POJ3616 Milking Time DP
- POJ3616 Milking Time (dp)
- POJ3616——Milking Time
- poj3616 Milking Time 入门dp
- POJ3616——Milking Time(动态规划)
- POJ 3616 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
- POJ 3616 Milking Time(最大递增子序列)
- sublime快捷键集合
- js ==与===的区别
- git clean命令
- 第12周项目3-图遍历算法实现
- 【知识点】Java学习之Java运算符
- poj3616——Milking Time(dp最大子序列)
- 人工神经网络本质理解
- tomcat 404
- for(初始化;条件判断;操作)
- Java之native
- Java用反射机制在不看类的实现方法下查看类的相关信息
- HYSBZ 4196 软件包管理器
- LazyViewPager
- Oracle扩展表空间提示