[pieces] LIS问题的递归写法和二分法

int h[30], k;
int dfs(int pre = 0, int cur = 1)
{
    if (cur > k)
        return 0;
    return max((h[cur] <= h[pre] || pre <= 0) ? dfs(cur, cur + 1) + 1 : 0, dfs(pre, cur + 1));
}

后记：学弟提问导弹拦截问题（最长不上升子序列）的递归写法。这是个复杂度很高的算法，出于下次抖机灵方便（误）记录于此。

最长上升子序列的比较正经的写法：

#include <stdio.h>
#include <string.h>
#include <algorithm>

using namespace std;

int num[10] = {3, 6, 3, 2, 4, 6, 7, 5, 4, 3};

const int INF = 0x3f3f3f3f;
int l = 10, g[100], d[100];

int main()
{
    fill(g, g + l, INF);
    int max_ = -1;
    for (int i = 0; i < l; i++)
    {
        int j = lower_bound(g, g + l, num[i]) - g;
        printf("d[%d] = %d  ", i, j + 1);
        d[i] = j + 1;
        if (max_ < d[i])
            max_ = d[i];
        g[j] = num[i];
        printf("g[%d] = %d\n", j, num[i]);
    }
    printf("\n");
    for (int i = 0; i < l; i++)
        printf("d[%d] = %d, g[%d] = %d\n", i, d[i], i, g[i]);
    printf("%d\n", max_);
    return 0;
}