poj 1631 nologn LIS

题意：

求LIS。

代码：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <stack>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <climits>
#include <cassert>
#define LL long long
#define lson lo, mi, rt << 1
#define rson mi + 1, hi, rt << 1 | 1

using namespace std;
const int maxn = 40000 + 10;
const int inf = 0x3f3f3f3f;
const double eps = 1e-8;
const double pi = acos(-1.0);
const double ee = exp(1.0);

int a[maxn];
int d[maxn];

int main()
{
#ifdef LOCAL
    freopen("in.txt", "r", stdin);
#endif // LOCAL
    int ncase;
    scanf("%d", &ncase);
    while (ncase--)
    {
        int n;
        scanf("%d", &n);
        for (int i = 0; i < n; i++)
        {
            scanf("%d", &a[i]);
        }
        memset(d, 0, sizeof(d));
        int len = 0;
        d[0] = a[0];
        for (int i = 1; i < n; i++)
        {
            if (d[len] < a[i])
            {
                len++;
                d[len] = a[i];
            }
            else
            {
                int lo = lower_bound(d, d + len, a[i]) - d;
                d[lo] = a[i];
            }
        }
        printf("%d\n", len + 1);
    }
    return 0;
}