POJ 1716 Integer Intervals 差分约束系统

题目：http://poj.org/problem?id=1716

题意：和poj 1201基本一样。。。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;

const int N = 50010;
const int INF = 0x3f3f3f3f;
typedef pair<int, int> P;
struct node
{
    int to, cost, next;
}g[N*10];
int head[N], dis[N], used[N];
int n, cnt;
void add_edge(int v, int u, int cost)
{
    g[cnt].to = u;
    g[cnt].cost = cost;
    g[cnt].next = head[v];
    head[v] = cnt++;
}
void spfa(int s)
{
    memset(dis, 0x3f, sizeof dis);
    memset(used, 0, sizeof used);
    queue<int> que;
    used[s] = true, dis[s] = 0;
    que.push(s);
    while(! que.empty())
    {
        int v = que.front(); que.pop();
        used[v] = false;
        for(int i = head[v]; i != -1; i = g[i].next)
        {
            int u = g[i].to;
            if(dis[u] > dis[v] + g[i].cost)
            {
                dis[u] = dis[v] + g[i].cost;
                if(! used[u])
                {
                    used[u] = true;
                    que.push(u);
                }
            }
        }
    }
}
int main()
{
    int a, b;
    while(~ scanf("%d", &n))
    {
        memset(head, -1, sizeof head);
        cnt = 0;
        int maxx = -INF, minn = INF;
        for(int i = 0; i < n; i++)
        {
            scanf("%d%d", &a, &b);
            add_edge(b + 1, a, -2);
            minn = min(minn, a);
            maxx = max(maxx, b + 1);
        }
        for(int i = minn; i < maxx; i++)
        {
            add_edge(i + 1, i, 0);
            add_edge(i, i + 1, 1);
        }
        spfa(maxx);
        printf("%d\n", -dis[minn]);
    }
    return 0;
}