poj 1716 Integer Intervals （差分约束）

Description

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.

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

题解

这题比考试题简单。。。轻松混过！跟着大佬的步伐水水水（不大佬几乎不做水题，只有这几道我能勉强做出来。。）

代码</