[USACO 2009 Dec S]Selfish Grazing

题目链接：https://ac.nowcoder.com/acm/problem/24867
来源：牛客网

Each of Farmer John’s N (1 <= N <= 50,000) cows likes to graze in a
certain part of the pasture, which can be thought of as a large
one-dimeensional number line. Cow i’s favorite grazing range starts at
location Si and ends at location Ei (1 <= Si < Ei; Si < Ei <=
100,000,000). Most folks know the cows are quite selfish; no cow wants
to share any of its grazing area with another. Thus, two cows i and j
can only graze at the same time if either Si >= Ej or Ei <= Sj. FJ
would like to know the maximum number of cows that can graze at the
same time for a given set of cows and their preferences.

题目大意：牧场有N头牛，每头牛都有它喜欢的放牧区间[si,Ei]
大多数人都知道母牛很自私。没有牛愿意与其他人共享任何放牧区域。因此，如果Si> = Ej或Ei <= Sj，则两只母牛i和j只能同时放牧。FJ希望知道给定的一组奶牛可以同时放牧的最大奶牛数量及其偏好。

These ranges represent (2, 4), (1, 12), (4, 5), (7, 10), and (7, 8), respectively.
For a solution, the first, third, and fourth (or fifth) cows can all graze at the same time. If the second cow grazed, no other cows could graze. Also, the fourth and fifth cows cannot graze together, so it is impossible for four or more cows to graze.

输入描述:

• Line 1: A single integer: N
• Lines 2…N+1: Line i+1 contains the two space-separated integers: Si and Ei

输出描述:

• Line 1: A single integer representing the maximum number of cows that can graze at once.

示例1
输入

5 
2 4 
1 12 
4 5 
7 10 
7 8 

输出

3

解法1：
定义最大共存区域数为cnt，初始化为1。按区域右端从小到大排序后，需要对别的两区域的情况如下，情况4、5下，可任取现一个区域都可为更新后的第一区域。仅当情况为1时，cnt加一，让第二区域的为更新后的第一区域；其他情况，保持第一区域为新的第一区域。