最长上升子序列LIS板子 O(nlogn)

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<deque>
#include<iomanip>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>
using namespace std;
//extern "C"{void *__dso_handle=0;}
typedef long long ll;
typedef long double ld;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define lowbit(x) x&-x

const double PI=acos(-1.0);
const double eps=1e-6;
const ll mod=1e9+7;
const int inf=0x3f3f3f3f;
const int maxn=1e5+10;
const int maxm=100+10;
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

ll a[maxn],d[maxn];
int top;
int main()
{
	int n; scanf("%d",&n);
	for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
	d[++top]=a[1];
	for(int i=2;i<=n;i++)
	{
		if(a[i]>d[top]) d[++top]=a[i];
		else
		{
			int pos=lower_bound(d+1, d+1+top, a[i])-d;
			d[pos]=a[i];
		}
	}
	printf("%d\n",top);
}