找点

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;

typedef struct node{
    int left,right;
}node;

bool cmp(node a,node b)
{
    return a.left<=b.left;
}

int main()
{
    int n,i,j,count,l,r;
    node p[1002];
    while(cin>>n){
        count=0;
        memset(p,0,sizeof(p));
        for(i=0;i<n;i++)
            cin>>p[i].left>>p[i].right;
        sort(p,p+n,cmp);
        i=0;
        while(i<n){
            l=p[i].left;
            r=p[i].right;
            for(j=i+1;j<n;j++){
                if(p[j].left<=r){
                    l=p[j].left;
                    if(p[j].right<=r)
                        r=p[j].right;
                }
                else
                    break;
            }
            count++;
            i=j;
        }
        cout<<count<<endl;
    }
    return 0;
}

总结：跟外星人的驿站、非洲小孩一样，都是找公共区间有几个，注释详见非洲小孩