zoj-3197-Google Book

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

2
3
1 1
2 2
3 3
3
1 1
1 3
3 3

Sample Output

3
1
区间覆盖问题,WA的好难受!!!
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
struct node
{
    int x;
    int y;
}a[5005];
int cmp(node a,node b)
{
    if(a.x!=b.x) return a.x<b.x;
    else return a.y>b.y;
}
int main()
{
    int s,n,i,j;
    scanf("%d",&s);
    while(s--)
    {
        int sum=1,top,low;
        scanf("%d",&n);
        for(i=0;i<n;i++)
            scanf("%d%d",&a[i].x,&a[i].y);
        sort(a,a+n,cmp);
        low=a[0].x;
        j=top=a[0].y;
        i=1;
        while(i<n&&a[i].x==low) i++;
        while(top!=n)
        {
            low=top+1;
            while(a[i].x<=low&&i<n)
            {
                if(j<a[i].y) j=a[i].y;
                i++;
            }
            sum++;
            top=j;
        }
        printf("%d\n",sum);
    }
    return 0;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值