http://acm.hdu.edu.cn/showproblem.php?pid=2037貪心水題

尼瑪被線段樹完虐...暫時轉戰貪心

#include<cstdio>#include<algorithm>using namespace std;pair<int,int>a[100];/*struct node{int first;int second;}a[100];bool cmp(node a,node b){ return a.first<b.first;}*/int main(){  int n;  while(~scanf("%d",&n)&&n)  {    for(int i=0;i<n;i++)    {scanf("%d%d",&a[i].second,&a[i].first);}      sort(a,a+n);     int con=1,tmp=a[0].first;   for(int i=1;i<n;i++)    if(tmp<=a[i].second)      {con++;tmp=a[i].first;}   printf("%d\n",con);  } return 0;}