1017. 怪盗基德的滑翔翼 最长上升子序列 线性dp

最长上升子序列：

#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

const int N = 110;

int n;
int h[N];
int f[N];

int main()
{
    int T;
    scanf("%d", &T);
    while (T -- )
    {
        scanf("%d", &n);
        for (int i = 0; i < n; i ++ ) scanf("%d", &h[i]);

        int res = 0;
        for (int i = 0; i < n; i ++ )//正向遍历
        {
            f[i] = 1;
            for (int j = 0; j < i; j ++ )
                if (h[i] < h[j])
                    f[i] = max(f[i], f[j] + 1);
            res = max(res, f[i]);
        }

        memset(f, 0, sizeof f);
        for (int i = n - 1; i >= 0; i -- )//反向遍历
        {
            f[i] = 1;
            for (int j = n - 1; j > i; j -- )
                if (h[i] < h[j])
                    f[i] = max(f[i], f[j] + 1);
            res = max(res, f[i]);
        }

        printf("%d\n", res);
    }

    return 0;
}

dp：

#include <iostream>
#include <cstring>

using namespace std;

const int N = 110;

int K, n;
int w[N];
int f_up[N], f_dw[N];


int main()
{
    scanf("%d", &K);
    while (K -- )
    {
        memset(f_up, 0, sizeof f_up);
        memset(f_dw, 0, sizeof f_dw);
        scanf("%d", &n);
        for (int i = 1; i <= n; ++ i) scanf("%d", &w[i]);

        //最长上升子序列
        //哨兵，不设置的话，需要在循环里额外写一条f[i]=1作为初值
        w[0] = 0;
        for (int i = 1; i <= n; ++ i)
        {
            for (int j = 0; j < i; ++ j)
            {
                if (w[i] > w[j]) f_up[i] = max(f_up[i], f_up[j] + 1);
            }
        }

        //反向最长上升
        w[n + 1] = 0;
        for (int i = n; i; -- i)
        {
            for (int j = n + 1; j > i; -- j)
            {
                if (w[i] > w[j]) f_dw[i] = max(f_dw[i], f_dw[j] + 1);
            }
        }

        int res = 0;
        for (int i = 1; i <= n; ++ i)
        {
            res = max(res, f_up[i]);
            res = max(res, f_dw[i]);
        }
        printf("%d\n", res);
    }
    return 0;
}