Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 12088 | Accepted: 5106 |
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
Source
思路:
定义dp[i]:取到第i 个区间时的最大牛奶量。
如果我们遍历所有时间点的话会超时。如果遍历区间的话就不会超时。
可以先对区间按照开始时间进行排序。更新到第i个区间时,先前检索i-1个区间的结束时间+r是否<=第i个区间的开始时间,如果满足,则可以更新dp[i]=max(dp[i],p[i].val+dp[j]);
如果没有满足的区间j,则dp[i]=p[i].val。
代码:
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
using namespace std;
#define inf 1<<29
int n,m,r;
long long dp[1000005];
struct node
{
long long st,ed,val;
}p[1005];
bool cmp(node a,node b)
{
return a.st < b.st;
}
int main()
{
while(~scanf("%d%d%d",&n,&m,&r))
{
for(int i=0;i<m;i++)
scanf("%lld%lld%lld",&p[i].st,&p[i].ed,&p[i].val);
memset(dp,0,sizeof dp);
long long ans=0;
sort(p,p+m,cmp);
for(int i=0;i<m;i++)
{
for(int j=0;j<i;j++)
{
if(p[j].ed+r<=p[i].st)
dp[i]=max(dp[i],p[i].val+dp[j]);
}
dp[i]=max(dp[i],p[i].val);
}
for(int i=0;i<m;i++)
ans=max(ans,dp[i]);
printf("%lld\n",ans);
}
return 0;
}