（kuangbin带你飞--基础DP）Milking Time poj3616

最新推荐文章于 2021-07-28 11:07:40 发布

deebcjrb

最新推荐文章于 2021-07-28 11:07:40 发布

阅读量222

点赞数

CC 4.0 BY-SA版权

分类专栏：动态规划（DP）文章标签： DP

本文链接：https://blog.csdn.net/weixin_43791787/article/details/98663202

动态规划（DP）专栏收录该内容

38 篇文章

订阅专栏

本文探讨了在限定时间内，如何通过合理安排挤奶时间和休息时间来最大化奶牛的产奶量。采用动态规划算法，考虑了挤奶时间间隔、效率及休息限制，解决了农场主在多个可能重叠的时间段内有效挤奶的问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

原题目：

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

Sample Output

中文概要：

奶牛在0~n的区间内产奶，农场主有m个时间段可以挤奶并且给出第i个时间段的挤奶产量，农场主每次挤完奶之后必须休息时间r之后才能工作，问农场主最多可以挤多少奶

#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
struct St
{
	int s,t,w;
}st[1005];
int dp[1005];
int n,m,r;
int cmp(St a,St b)
{
	return a.t<b.t;
}
int main()
{
	while(scanf("%d%d%d",&n,&m,&r)!=EOF)
	{
		for(int i=0;i<m;i++)
		{
			scanf("%d%d%d",&st[i].s,&st[i].t,&st[i].w);
		}
		sort(st,st+m,cmp);
		int ans=-1;
		for(int i=0;i<m;i++)
		{
			dp[i]=st[i].w;
			for(int j=0;j<i;j++)
			{
				if(st[j].t+r<=st[i].s)
				{
					dp[i]=max(dp[i],dp[j]+st[i].w);
				}
			}
			ans=max(ans,dp[i]);
		}
		printf("%d\n",ans); 
	}
	return 0;
 }

思路：

还是DP的遍历吧，选出最大的

贪心解决不了问题还是得动态规划，dp[i]表示第i个时间段能获得的最大奶量,dp[i]=max(dp[i],dp[j]+fr[i].val); 注意这个dp[j]的结束时间不能和dp[i]的开始时间冲突