差分约束系统相关练习题

POJ1716

An integer interval [a,b], a < b, is a set of all consecutive integers beginning with a and ending with b. 
Write a program that: finds the minimal number of elements in a set containing at least two different integers from each interval.

一个整数区间[A,B]是一个以a为开头，b为结尾的连续整数集合。写一个程序带有以下功能：找到满足在所有已知区间内都至少包含这个已知区间两个元素的这样一个区间的最小元素数。

Input

The first line of the input contains the number of intervals n, 1 <= n <= 10000. Each of the following n lines contains two integers a, b separated by a single space, 0 <= a < b <= 10000. They are the beginning and the end of an interval.

Output

Output the minimal number of elements in a set containing at least two different integers from each interval.

Sample Input

4
3 6
2 4
0 2
4 7

Sample Output

4

本题从差分约束的角度上来看，存在三个不等式：

1. 假如说occurance[i]代表在[1,i]范围内所求区间与当前区间重叠元素数，那么必定存在occurance[b+1](此时包含区间右端点）-occurance[a]≥2（右端点减左端点的值，也就是在本区间内必须存在至少两个重叠元素）。
2. 隐含条件：occurance[i]-occurance[i-1]≥0 和occurance[i]-occurance[i-1]≤1,也就是说在两个数之间（一个数的位置）不可能存在大于一个数的重叠情况和小于0的重叠情况。

整理可得occurance（以下简称o）

1. o(i)-o(i-1)≥0 
2. o(i-1)-o(i)≥-1
3. o(b+1)-o(a)≥2

对以上三种情况建边，因为是大于号，所以直接求最长路即可。

 

//#include<pch.h>
#include <iostream>
#include <cstdio>
//#include <bits/stdc++.h>
#include<queue>
#include <map>
#include <algorithm>
#include <stack>
#include <iomanip>
#include <cstrin