最长上升子序列

#include <iostream>
#include <cstdio>

using namespace std;

const int oo=233333333;
const int ML=100100;

int tp;
int f[ML];

void Push() { tp++; f[tp]=oo; }

int Find(int le,int ri,int x)
{
	for ( ; le+1<ri; )
	{
		int mid=(le+ri)>>1;

		if (x<=f[mid]) ri=mid; else le=mid; 
	}

	return ri;
}//二分查找

int a[100100];

int main()
{
	int n; scanf("%d",&n);

	for (int i=0; i<n; i++) scanf("%d",&a[i]);

	f[0]=-oo; Push();

	for (int i=0; i<n; i++)
	{
		int p=Find(0,tp,a[i]);

	f[p]=a[i];  //更新

		if (p==tp) Push();
	}

	printf("%d",tp-1);

	return 0;
}