;const int maxl=100005;int l,a[maxl],c[maxl];int find(int l,int r,int x){int mid=(l+r)/2;if (l==r)return l;if (c[mid]>x)return find(l,mid,x);elsereturn find(mid+1,r,x); }void work(){int len=0,j;c[1]=-10000;for (int i=1;i<=l;++i){if (a[i]>c[len])j=++len;else j=find(1,len,a[i]);c[j]=a[i];}printf(“%d\n”,len);}void init(){while (scanf(“%d”,&l)==1){for (int i=1;i<=l;++i)scanf(“%d”,&a[i]);work();}}int main(){init();return 0;}
，绊脚石乃是进身之阶。
