nlogn 最长上升子序列

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cstdlib>
using namespace std;
const int maxn = 500;
const int INF = ~0U >> 1;
int a[maxn], d[maxn];  /// a原数据  d[i] 表示长度为i的上升子序列里面最大的那个数
int n;

int main() {
scanf("%d", &n);
for(int i = 0; i < n; ++i)
scanf("%d", &a[i]);
for(int i = 0; i <= n; ++i) d[i] = INF;
int len = 0, x;
d[0] = 0;
for(int i = 0; i < n; ++i) {
if(d[len] < a[i]) x = ++len;
else x = lower_bound(d, d + n, a[i]) - d;
d[x] = a[i];
}
printf("%d\n", len);
return 0;
}