【贪心算法】今年暑假不AC

#include<iostream>#include<algorithm>using namespace std;#define N 101typedef struct TV{int start;int end;}TV;TV list[N];bool cmp(TV a,TV b){if(a.start<b.start)return true;elsereturn false;}int main(){int n,i,j,num,max;while(cin>>n){if(n==0)return 0;max=0;for(i=1;i<=n;i++)cin>>list[i].start>>list[i].end;sort(list+1,list+n+1,cmp);for(j=1;j<n;j++){num=0;int end=list[i].end;num++;for(i=j+1;i<=n;i++){if(list[i].start>=end){end=list[i].end;num++;}elsecontinue;}if(num>max)max=num;}cout<<max<<endl;}return 0;}