Time Limits: 1000 ms Memory Limits: 65536 KB Detailed Limits
1 #include <bits/stdc++.h> 2 using namespace std; 3 const int MAXN=1e5+5; 4 const int INF=2e9; 5 struct node { 6 int l,r; 7 }a[MAXN]; 8 int n; 9 int s[MAXN],top; 10 bool cmp (node a,node b){ 11 if (a.l==b.l) return a.r<b.r; 12 return a.l>b.l; 13 } 14 int main(){ 15 cin>>n; 16 for (int i=1;i<=n;i++){ 17 scanf ("%d%d",&a[i].l,&a[i].r); 18 } 19 sort (a+1,a+n+1,cmp); 20 for (int i=1;i<=n;i++){ 21 int t=a[i].r; 22 if (t>=s[top]) s[++top]=t; 23 else { 24 int l=1,r=top,mid; 25 while (l<=r){ 26 mid=(l+r)/2; 27 if (s[mid]<=t) l=mid+1; 28 else r=mid-1; 29 } 30 s[l]=t; 31 } 32 } 33 cout<<top<<endl; 34 return 0; 35 }