hdu1950 最长上升子序列nlogn

简单。

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
const int MAXN = ;
int a[MAXN],s[MAXN];
int serch(int left, int right, int v)
{
    int l, r, m;
    l = left, r = right;
    while(l <= r)
    {
        m = (l + r) / ;

         if(v > s[m])
            l = m + ;
        else r = m - ;
    }
    return l;
}
int main()
{
    int i, j, t, n;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d", &n);
        for(i = ; i <= n; i++)
        {
            scanf("%d", &a[i]);
        }
        memset(s, , sizeof(s));
        s[] = a[];
        int len = ;
        for(i = ; i <= n; i++)
        {
            int ft = serch(, len, a[i]);
            if(ft > len){
                len ++;
                s[len] = a[i];
            }
            else
                s[ft] = a[i];
        }
        printf("%d\n", len);
    }
}