关于区间最小覆盖的问题总结（以zoj 3197 Google Book 为例）

关于这类问题，现在我就想到两种做法，一种时间复杂度O(nlog(n),一种为O(n)的算法。

先来看一下题目:

Google Book

---

Time Limit: 1 Second       Memory Limit: 32768 KB

---

You, the best hacker in the world, want to download the books published on Google Book. After some investigation, you found that the address of each page consists of two parts. The first part is the page number, the second part is the signature which is unique for each page. To get the signature, you can send the query to the server. The query has one parameter, which indicates the page number. The server will return the signature of the required page, and it may also return the signature of some adjacent pages.

To minimize the bytes downloaded from the internet, and also make the server adminstrator hard to notice your "hack", you'd like to minimize the number of queries

Input