R
来源:互联网 发布:蓝月翅膀升级数据 编辑:程序博客网 时间:2024/04/30 14:27
点击打开链接
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.
* 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
* Line 1: The maximum number of gallons of milk that Bessie can product in the N hours
12 4 21 2 810 12 193 6 247 10 31
43
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;long long dp[1005];struct stu{int sta,endd;long long eff;}a[1005];bool cmp(stu b,stu c){return b.endd<c.endd;}int main(){int n,m,r,i,j;while(~scanf("%d %d %d",&n,&m,&r)){memset(dp,0,sizeof(dp));for(i=1;i<=m;i++) scanf("%d %d %lld",&a[i].sta,&a[i].endd,&a[i].eff); sort(a+1,a+1+m,cmp); long long sum=0; dp[1]=a[1].eff; for(i=2;i<=m;i++) { for(j=1;j<i;j++) { if(a[i].sta-a[j].endd>=r) dp[i]=max(dp[i],dp[j]+a[i].eff); else dp[i]=max(dp[i],max(dp[j],a[i].eff));}sum=max(dp[i],sum);}printf("%lld\n",sum);}}
- r
- r
- R
- r
- r
- r
- R
- R
- r
- R
- r
- R
- r
- R
- R
- R
- R
- r
- QNX手册学习笔记————中断机制
- TensorFlow手写汉字识别
- python numpy
- http协议几种数据传输方式
- JavaScript HTML DOM 事件机制,常用方法
- R
- 从高版本JDK换成低版本JDK报错Unsupported major.minor version 52.0
- QNX手册学习笔记------同优先级调度算法
- 《Deep Learnning Tutorial》笔记(一)
- HDFS测试
- Tarjan模板题 The Bottom of a Graph
- 中兴新支点操作系统上的文件小贴士
- 使用Spring MVC拦截器管理操作日志
- 关于眼图