51nod-最长单增子序列

如果不会，那就耐心的看题解 

<span style="font-size:18px;">#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
#define inf 0x3f3f3f3f
int num[50000+11];
int num2[50000+11];
int main()
{
	int n;
	scanf("%d",&n);
	fill(num2,num2+n+10,inf);
	num2[0]=-inf;
	for(int i=1;i<=n;++i)
		scanf("%d",&num[i]);
	int ans=1;
	for(int i=1;i<=n;++i)
	{
		int pos=upper_bound(num2,num2+n+10,num[i])-num2;
		num2[pos]=num[i];
		if(pos>ans)
			ans=pos;
	}
	/*for(int i=1;i<=ans;++i)
		printf("%d ",num2[i]);
	printf("\n");*/ 
	printf("%d\n",ans);
	return 0;
}</span>