DP_Milking Time
2019-08-16 07:57:06来源:博客园 阅读 ()
DP_Milking Time
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 Nhours
Sample Input
12 4 2 1 2 8 10 12 19 3 6 24 7 10 31
Sample Output
43
题意:农夫在M个时间段内可以挤奶(起始时间ST,终止时间ET,该时间段内可以获取的奶量C),奶牛每次产奶后需要休息R小时,求在给定时间,求奶牛在这段时间内的最大产奶量。
思路:每次产奶后需要休息R个小时,即挤奶的时间段可视为ST~ET+R。
1、将区间按时间段的开始时间进行排序。
2、建立数组s[]表示包含本区间并以此区间结尾的区间的最大挤奶量 如 s[3]即为包含有p[3].st~p[3].et区间并以p[3].st~p[3].et结尾的区间的最大挤奶量
3、s[]的递推公式: 若此区间可与前面的区间相接,则保留这个挤奶量,并最终将这些挤奶量的最大值存于数组是s[]
s[]=max{可与当前区间相接的前面区间的s[]+当前区间的挤奶量};
4、遍历数组s[]求数组S中所存的最大值
1 #include<cstdio> 2 #include<algorithm> 3 using namespace std; 4 int s[1005]; 5 struct Node{ 6 int st,et,c; 7 }p[1005]; 8 bool cmp( Node a, Node b){ 9 if( a.st<b.st ) 10 return true; 11 return false; 12 } 13 void dp( int m){ 14 for( int i=0; i<m; i++){ 15 s[i]=p[i].c; 16 for( int j=0; j<i; j++){ 17 if( p[j].et<=p[i].st ) 18 s[i]=max(s[i],s[j]+p[i].c); 19 } 20 } 21 } 22 int main() 23 { 24 int n,m,r; 25 int max; 26 27 while(~scanf("%d%d%d",&n,&m,&r)){ 28 max=-1; 29 for( int i=0; i<m; i++){ 30 scanf("%d%d%d",&p[i].st,&p[i].et,&p[i].c); 31 p[i].et+=r; 32 } 33 sort(p,p+m,cmp); 34 dp(m); 35 for( int i=0; i<m; i++) 36 if( s[i]>max ) 37 max=s[i]; 38 printf("%d\n",max); 39 } 40 41 return 0; 42 }View Code
原文链接:https://www.cnblogs.com/konoba/p/11287050.html
如有疑问请与原作者联系
标签:
版权申明:本站文章部分自网络,如有侵权,请联系:west999com@outlook.com
特别注意:本站所有转载文章言论不代表本站观点,本站所提供的摄影照片,插画,设计作品,如需使用,请与原作者联系,版权归原作者所有
上一篇:长乐培训Day9
下一篇:高...高精度!!!
- 设计一个多功能的MyTime类 代码参考 2020-03-29
- 设计MyTime类 代码参考 2020-03-29
- Run-Time Check Failure #0 - The value of ESP was not pro 2019-11-11
- Prime Time UVA - 10200(精度处理,素数判定) 2019-08-16
- c#.net常用函数和方法集汇总 2019-06-14
IDC资讯: 主机资讯 注册资讯 托管资讯 vps资讯 网站建设
网站运营: 建站经验 策划盈利 搜索优化 网站推广 免费资源
网络编程: Asp.Net编程 Asp编程 Php编程 Xml编程 Access Mssql Mysql 其它
服务器技术: Web服务器 Ftp服务器 Mail服务器 Dns服务器 安全防护
软件技巧: 其它软件 Word Excel Powerpoint Ghost Vista QQ空间 QQ FlashGet 迅雷
网页制作: FrontPages Dreamweaver Javascript css photoshop fireworks Flash