动态规划-Milking Time

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

题意：这一题的大致题意就是给你一些时间区间，一头奶牛能够在这些区间工作但每次工作后都需要休息，求它最大能挤多少奶

思路：这一题是最长上升序列的一个变形，我们只要求出最长的上升区间就可以了。

代码

#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
int dp[1001000];
struct l
{
	int t1,t2,t3;
}stud[1001000];
bool my(l x,l y)
{
	if(x.t2==y.t2) return x.t1<y.t1;
	else return x.t2<y.t2;
}
int main()
{
	int n,t,m,i,j,r;
	scanf("%d %d %d",&n,&m,&r);
	n=n+r;
	for(i=0;i<m;i++)
	{
		scanf("%d %d %d",&stud[i].t1,&stud[i].t2,&stud[i].t3);
		stud[i].t2=stud[i].t2+r;
		if(stud[i].t2>n)
		{
			i--;
			m--;
		}	
	}
	sort(stud,stud+m,my);
	//stud[m-1].t2-=r;
	int ans=-9999;
	for(i=0;i<m;i++)
	{
		dp[i]=stud[i].t3;
		for(j=0;j<i;j++)
		{
			if(stud[j].t2<=stud[i].t1&&stud[j].t2<=n)
			{
				dp[i]=max(dp[i],dp[j]+stud[i].t3);
			}
		}
		ans=max(ans,dp[i]);
	}
	printf("%d",ans);
}