杭电ACM 第2037题

#include
#include
#include

using namespace std;
struct Stu{
public:
    int startime;
    int endtime;
    int hostime;
    void shuru(int sta,int en){
        startime=sta;
        endtime=en;
        hostime=en-sta;
    }
};
int Comp(const void*p1,const void *p2){
    struct Stu *c=(Stu*)p1;
    struct Stu *d=(Stu*)p2;
    if(c->hostime!=d->hostime)
        return(c->hostime-d->hostime);
    else
        return(c->startime-d->startime);

}
int Comp(const void *p1,const void *p2);
struct Stu;
void main(){
    unsigned n;

    while(cin>>n&&n!=0){
        Stu s[100];
        int count=0;
        int w,q;
        
        for(int k=0;k<n;++k){
            cin>>w>>q;
            s[k].shuru(w,q);
            
        }
        qsort(s,n,sizeof(s[0]),Comp);
        bool bs[100];
        memset(bs,true,sizeof(bool)*100);
        for(int i=0;i<n;++i){
            bool qt=true;
            for(int aa=(s[i]).startime;aa<(s[i]).endtime;++aa){
                if(!bs[aa])
                    qt=false;
            }
            if(qt){
                ++count;
                for(int j=(s[i]).startime;j<(s[i]).endtime;++j){
                    bs[j]=false;
                }
            }
        }
    cout<<count<<endl;
    }
    
}