[ CodeVS冲杯之路 ] P3955

 1 #include<cstdio>
 2 #include<cstdlib>
 3 #include<cstring>
 4 #include<cmath>
 5 #include<iostream>
 6 #include<algorithm>
 7 using namespace std;
 8 
 9 const int N=1000001;
10 int a[N];
11 inline int find(int x,int l,int r)
12 {
13     if (l>=r) return l;
14     int mid=(l+r)>>1;
15     return a[mid]>=x?find(x,l,mid):find(x,mid+1,r);
16 }
17 int main()
18 {
19     int n,m=0,x;
20     scanf("%d",&n);
21     while (n--)
22     {
23         scanf("%d",&x);
24         a[x>a[m]?++m:find(x,1,m)]=x;
25     }
26     printf("%d\n",m);
27     return 0;
28 }