Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 10268 | Accepted: 4291 |
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
题意:在N小时内奶牛产奶,中间有M个时间段,然后每次产完奶必须休息R小时。
思路:既然休息R小时不如把这R小时加在产奶结束时间里,然后县排个序,再从后面往前扫这样才能保证最大。
代码:
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <cmath>
using namespace std;
#define ll long long int;
#define ma(a) memset(a,0,sizeof(a));
struct node
{
int s,e,num;
}a[1005];
bool cmp(node a,node b)
{
if(a.s!=b.s)
{
return a.s<b.s;
}
else return a.e<b.e;
}
int dp[1005];
int main()
{
int M,N,R;
while(scanf("%d %d %d",&N,&M,&R)!=EOF)
{
int i,j;
for(i=0;i<M;i++)
{
scanf("%d %d %d",&a[i].s,&a[i].e,&a[i].num);
a[i].e+=R;
}
sort(a,a+M,cmp);
ma(dp);
for(i=M-1;i>=0;i--)
{
dp[i]=a[i].num;
for(j=i+1;j<M;j++)
{
if(a[j].s>=a[i].e)
{
dp[i]=max(dp[i],dp[j]+a[i].num);
}
}
}
int maxn=0;
for(i=0;i<=M-1;i++)
{
maxn=max(dp[i],maxn);
}
cout<<maxn<<endl;
}
return 0;
}