100Pts求调

#include<bits/stdc++.h>
using namespace std;
int n,l,k,b[10005],d[10005],a[10005];
int main()
{
	cin>>n;
	for(int i=1;i<=n;++i) 
	{
		cin>>a[i];
	}
	if(n==0)
	{
		printf("0\n");
		return 0;
	}
	int len=1;d[1]=a[1];
	for(int i=2;i<=n;++i)
	{
		if(a[i]>d[len]) d[++len]=a[i];
		else
		{
			int j=upper_bound(d+1,d+len+1,a[i])-d;
			d[j]=a[i];
		}
		b[i]=len;
	}
	printf("%d\n",len);
	return 0;
}