LIS (最长上升子序列)

//#pragma comment(linker, "/STACK:102400000, 102400000")
#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <vector>
#include <cmath>
#include <ctime>
#include <list>
#include <set>
#include <map>
using namespace std;
typedef long long LL;
typedef pair <int, int> P;
const int N = 1e5 + 5;
int dp
, a
, inf = 1e6;

int main()
{
int n;
while(~scanf("%d", &n)) {
for(int i = 0; i <= n + 1; ++i)
dp[i] = inf;
for(int i = 1; i <= n; ++i) {
scanf("%d", a + i);
*lower_bound(dp, dp + n, a[i]) = a[i];
}
printf("%d\n", lower_bound(dp, dp + n, inf) - dp);
}
return 0;
}