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
题意是有一共n分钟的时间去挤奶,给我们m个具体去挤牛奶的时间段(包括开始时间,结束时间,和价值),每次挤完奶后都有休息r分钟。求最大价值。
0-1背包问题。现将这m个时间段按照开始时间从小到大排序,在按照上一个的结束时间小于等于下一个的开始时间进行判断(注意给出的并不是真的结束时间,还要加上r分钟)。然后写出状态转移方程即可。
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
using namespace std;
struct cow
{
int start;
int end;
int eff;
}a[10000];
bool cmp(cow a,cow b)
{
return a.start<=b.start;
}
int main()
{
int n,m,r;
int dp[10000];
int ans=0;
while(cin>>n>>m>>r)
{
memset(dp,0,sizeof(dp));
for(int i=0;i<m;i++)
{
cin>>a[i].start>>a[i].end>>a[i].eff;
a[i].end+=r;
}
sort(a,a+m,cmp);
for(int i=0;i<m;i++)
{
dp[i]=a[i].eff;
ans=max(ans,dp[i]);
for(int j=0;j<i;j++)
{
if(a[j].end<=a[i].start)
{
dp[i]=max(dp[i],dp[j]+a[i].eff);
ans=max(ans,dp[i]);
}
}
}
cout<<ans<<endl;
}
}