POJ 1201 Intervals

题目链接：http://poj.org/problem?id=1201

题意：构造一个集合，使得集合内的数字满足所给的n个条件，每个条件给出一个区间[L,R]和k，要求在此区间内至少存在k个数。所有的数都是非负数。

思路：设Si为区间[0,i-1]内至少存在数的个数。对于区间[L,R],即Sr+1 - Sl >= k 转化为约束条件，同时对于任意[i,i+1]有0<=Si+1 - Si<=1。

#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <sstream>
#include <queue>
#include <utility>
using namespace std;

#define rep(i,j,k) for (int i=j;i<=k;i++)
#define Rrep(i,j,k) for (int i=j;i>=k;i--)

#define Clean(x,y) memset(x,y,sizeof(x))
#define LL long long
#define ULL unsigned long long
#define inf 0x7fffffff
#define mod 100000007
const int maxn = 100009;

struct node
{
    int to,w,next;
}edge[maxn*2];
int head[maxn];
int tot = 0;
int n,m;
void addedge(int x,int y,int z)
{
    tot++;
    edge[tot].w = z , edge[tot].to = y , edge[tot].next = head[x];
    head[x] = tot;
}

int dis[maxn];

bool spfa( int st  )
{
	bool vis[maxn];
	int outque[maxn];
	memset(vis,0,sizeof(vis));
	memset(outque,0,sizeof(outque));
	for( int i = 0; i <=n+1; i++ ) dis[i] = inf;//初始化距离
	queue<int> q;
	q.push(st) , vis[st] = true , dis[st] = 0;//初始状态
	while( !q.empty() )
	{
		int u = q.front();
		q.pop();
		outque[u]++ , vis[u] = false;
		if ( outque[u] > n+2 ) return false; //有负环 无最短路

		for( int k = head[u]; k != -1; k = edge[k].next )
		{
			int v = edge[k].to;
			if ( dis[v] > dis[u] + edge[k].w )
			{
				dis[v] = dis[u] + edge[k].w;
				if( !vis[v] )	vis[v] = true , q.push( v );
			}
		}
	}
	return true;
}

void init()
{
    int x,y,k;
    cin>>m;
    Clean(head,-1) , tot = 0;
    n = 0;
    rep(i,1,m)
    {
        scanf("%d %d %d",&x,&y,&k);
        addedge( y+1 , x , -k );
        n = max( n , y );
    }
    rep(i,1,n+1) addedge(i-1,i,1) , addedge(i,i-1,0);
}
void solve()
{
    spfa(n+1);
    cout<<-dis[0]<<endl;
}

int main()
{
    init();
    solve();
    return 0;
}