ZOJ 3197 Goole Book

最新推荐文章于 2015-12-18 18:14:21 发布

蝌蚪code

最新推荐文章于 2015-12-18 18:14:21 发布

阅读量326

点赞数

分类专栏： ZOJ

本文链接：https://blog.csdn.net/u011922039/article/details/38499457

版权

ZOJ 专栏收录该内容

33 篇文章 0 订阅

订阅专栏

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

The input has multiple cases.
The first line of the input is a single integer T which is the number of test cases. Then T consecutive test cases follow. In each test case, the first line is a number N (1<=N<=5000), indicating the number of pages of the book. Then n lines follows. On the i-th line, there will be two integers ai and bi (ai<=i<=bi). They indicate that the query for the i-th page will return the signatures from page ai to page bi (inclusive)

Output

Results should be directed to standard output. The output of each test case should be a single integer, which is the minimum number of queries to get all the signatures.

Sample Input

Sample Output

3
1

Author: FAN, Xiang
Source: ZOJ Monthly, May 2009

源码：

解题报告：
该题采用贪心算法，属于最小区间覆盖问题。
首先先将区间按照左端从小到大排序。
然后对于其中一个区间【left right】接下来的n个区间K 如果K_left小于等于right+1 在这些区间中选出K_right最大值的区间，这个区间就是这些区间里的有用区间，此时个数加加。
上述代码 35行 right=temp+1 temp 就是最大K_right。加一的目的是为下个循环做准备