HDU 1950 Bridging signals

那么一大篇的题目描述还真是吓人。

仔细一读其实就是一个LIS，还无任何变形。

刚刚学会了个二分优化的DP，1A无压力。

//#define LOCAL
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

const int maxn = 40000 + 10;
int a[maxn];
int dp[maxn];

int main(void)
{
    #ifdef LOCAL
        freopen("1950in.txt", "r", stdin);
    #endif

    int N;
    scanf("%d", &N);
    while(N--)
    {
        int n;
        scanf("%d", &n);
        int i;
        for(i = 1; i <= n; ++i)
            scanf("%d", &a[i]);
        dp[1] = a[1];
        int len = 1;

        for(i = 2; i <= n; ++i)
        {
            int left = 1;
            int right = len;
            while(left <= right)
            {
                int mid = (left + right) >> 1;
                if(dp[mid] < a[i])
                    left = mid + 1;
                else
                    right = mid - 1;
            }
            dp[left] = a[i];
            if(left > len)
                ++len;
        }
        printf("%d\n", len);
    }
    return 0;
}