poj 1201（差分约束系统，bellman）

Description

You are given n closed, integer intervals [ai, bi] and n integers c1, ..., cn.
Write a program that:
reads the number of intervals, their end points and integers c1, ..., cn from the standard input,
computes the minimal size of a set Z of integers which has at least ci common elements with interval [ai, bi], for each i=1,2,...,n,
writes the answer to the standard output.

Input

The first line of the input contains an integer n (1 <= n <= 50000) -- the number of intervals. The following n lines describe the intervals. The (i+1)-th line of the input contains three integers ai, bi and ci separated by single spaces and such that 0 <= ai <= bi <= 50000 and 1 <= ci <= bi - ai+1.

Output

The output contains exactly one integer equal to the minimal size of set Z sharing at least ci elements with interval [ai, bi], for each i=1,2,...,n.

Sample Input

5
3 7 3
8 10 3
6 8 1
1 3 1
10 11 1

Sample Output

6

思路：令x[i]表示[0,i)区间中被选中的数字的数量，那么题目即是求最小的x[MAX]

参考代码：

#include <iostream>
#include <cstdio>

using namespace std;

struct Edge
{
	int u,v,w;
}e[500000];

int Max,Min,cnt,dist[50006];

int bellman()
{
	int i,j,k;
	memset(dist,0,sizeof(dist));
	dist[Min]=0;
	for(j=0;j<Max-Min;j++)
	{
		bool flag=true;
		for(i=0;i<cnt;i++)
		{
			if(dist[e[i].u]+e[i].w>dist[e[i].v])
			{
				flag=false;
				dist[e[i].v]=dist[e[i].u]+e[i].w;
			}
		}
		for(i=Min;i<Max;i++)
		{
			if(dist[i+1]<dist[i])
			{
				flag=false;
				dist[i+1]=dist[i];
			}
		}
		for(i=Max;i>Min;i--)
		{
			if(dist[i-1]<dist[i]-1)
			{
				flag=false;
				dist[i-1]=dist[i]-1;
			}
		}
		if(flag)
		{
			return dist[Max];
		}
	}
	return dist[Max];
}

int main()
{
//	freopen("in.txt","r",stdin);
	int i,j,k,n;
	scanf("%d",&n);
	Min=1<<30;
	cnt=0;
	Max=0;
	while(n--)
	{
		scanf("%d%d%d",&i,&j,&k);
		j++;
		if(i<Min)
		{
			Min=i;
		}
		if(j>Max)
		{
			Max=j;
		}
		e[cnt].u=i;
		e[cnt].v=j;
		e[cnt++].w=k;
	}
	printf("%d/n",bellman());
	return 0;
}