HDU2037小技巧

#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include <limits.h>
#include <string.h>
#include <ctype.h>
#include <algorithm>
#include <iostream>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <vector>
#include <math.h>
#include <string>
using namespace std;
struct node{
    int x;
    int y;
}a[110];

bool cmp(node a,node b){
    if(a.y == b.y)//我们的目的是为了获得更多的电视节目，所以在排序的的时候应该要先按结束的时间从小到大排列
        return a.x < b.x;
    return a.y < b.y;
}

int main(){
    int n,i;
    
    while(~scanf("%d",&n)){
        if(n == 0)
            break;
        int mark=2;
        for(i=0;i<n;i++){
            scanf("%d%d",&a[i].x,&a[i].y);
        }
        sort(a,a+n,cmp);
        int j;
        int k;
        int ans = -1000;
        int count=1;
        for(k=0;k<n;k++){
            count = 1;
            mark = 2;
            for(j=k;j<n;){
                for(i=j+1;i<n;i++){
                    if(a[i].x >= a[j].y){
                        count++;
                        mark = 1;
                        break;
                    }
                }
                if(mark == 1){
                    j = i;
                }
                else{
                    break;
                }
            }
            if(count > ans){
                ans = count;
            }
        }
        
        printf("%d\n",ans);
    }
    
    return 0;
}