【动态规划，带权重的区间调度】：poj3616，Milking Time

http://poj.org/problem?id=3616

# include<iostream>
# include<algorithm>
using namespace std;

# define M 1003

struct INTERVAL
{
	int s,e,w;
};

INTERVAL interval[M];
int unOverlap[M];

int cmp(INTERVAL a, INTERVAL b)
{
	return a.e<b.e;
}

void ComputeOverlap(int m, int r)
{
	int i,j;
	for(i=m;i>=1;i--)
	{
		for(j=i-1;j>=1;j--)
		{
			if(interval[i].s<interval[j].e+r) //j and i overlap
			{
				//do nothing
			}
			else
			{
				break;
			}
		}
		unOverlap[i]=j;
	}
}

int main()
{
	int n,m,r,state[M];
	int i,j,k;
	cin>>n>>m>>r;
	for(i=1;i<=m;i++)
	{
		cin>>interval[i].s>>interval[i].e>>interval[i].w;
	}
	sort(interval+1,interval+1+m,cmp);
	//for(i=1;i<=m;i++)
	//{
	//	cout<<interval[i].s<<" "<<interval[i].e<<" "<<interval[i].w<<endl;
	//}

	ComputeOverlap(m,r); //un overlap, in fact

	state[0]=0;
	for(i=1;i<=m;i++)
	{
		state[i]= ( state[i-1] > (state[unOverlap[i]]+interval[i].w) )? state[i-1] : (state[unOverlap[i]]+interval[i].w) ; 
	}
	cout<<state[m]<<endl;

	return 0;
}