- #include <iostream>
- using namespace std;
- int a[100001],f[100001],c[100001];
- int i,j,size;
- int binarySearch(int n)
- {
- int low=1,high=size,mid;
- while (low>size)
- {
- mid=(low+high)/2;
- if(a[n]==a[mid])
- return mid;
- if(a[mid]>a[n])
- high=mid-1;
- else
- low=mid+1;
- }
- }
- int main()
- {
- int n;
- cin>>n;
- if(!n)
- {
- cout<<1<<endl;
- exit(0);
- }
- for(i=0;i<n;i++)
- cin>>a[i];
- c[1]=a[1],size=1;
- for (i=2;i<=n;i++)
- {
- if (a[i]==0) continue;
- if (a[i]<=c[1]) j=1;
- else if (a[i]>c[size]) j=++size;
- else if(a[i]<=c[size]) j=binarySearch(a[i]);
- c[j]=a[i];
- }
- cout<<size<<endl;
- return 0;
- }
- //该片段来自于http://www.codesnippet.cn/detail/1709201410453.html
来源: http://www.codesnippet.cn/detail/1709201410453.html