问题描述
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.
输入
* 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
输出
* Line 1: The maximum number of gallons of milk that Bessie can product in the N hours
样例输入
12 4 2 1 2 8 10 12 19 3 6 24 7 10 31
样例输出
43
先按结束时间排序,然后我们令dp[i]表示第i个时间段能获得的最多的牛奶,于是dp[i]=max(dp[i],dp[k]+no[i].f).
其中 k表示在从1到i中满足 no[k].end+r<=no[i].star 最大的那个时间段,k的寻找可以用二分来查找。于是整个算法的时间复杂度为O(mlogm)
代码如下:
#include <stdio.h>
#include <iostream>
#include <string.h>
#include <algorithm>
using namespace std;
struct node
{
int s,e,f;
}no[1005];
int dp[1005];
int n,m,r;
bool cmp(node a,node b)
{
return a.e<b.e;
}
int be(int y,int h)
{
int l=1,r=h;
while(l<=r)
{
int mid=(l+r)>>1;
if(no[mid].e==y)
return mid;
else if(no[mid].e>y)
{
r=mid-1;
}
else
l=mid+1;
}
if(no[l].e>y)
return l-1;
else
return l;
}
int main()
{
scanf("%d %d %d",&n,&m,&r);
{
for(int i=1;i<=m;i++)
scanf("%d %d %d",&no[i].s,&no[i].e,&no[i].f);
sort(no+1,no+1+m,cmp);
for(int i=1;i<=m;i++)
int te=no[i].s-r;
int x=be(te,m);
dp[i]=max(dp[i-1],dp[x]+no[i].f);
}
printf("%d\n",dp[m]);
}
}