最长上升公共子序列问题求解

原创于 2021-10-27 08:54:35 发布

· 106 阅读

0 ·

版权

文章标签：

#动态规划

CSP考试专题专栏收录该内容

2 篇文章

订阅专栏

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;

const int N = 3010;
int n;
int a[N], b[N];
int f[N][N];

int main()
{
    int n;
    cin >> n;
    for (int i = 1; i <= n; i ++)
        scanf ("%d", &a[i]);
    for (int i = 1; i <= n; i ++)
        scanf ("%d", &b[i]);
    for (int i = 1; i <= n; i ++)
    {
        int mx = 1;
        for (int j = 1; j <= n; j ++)
        {
            f[i][j] = f[i - 1][j];
            if (a[i] == b[j])
                f[i][j] = max(f[i][j], mx);
            if (b[j] < a[i])
                mx = max(mx, f[i][j] + 1);
        }
    }
    int res = 0;
    for (int i = 1; i <= n; i ++)
        res = max(res, f[n][i]);
    cout << res << endl;
    return 0;
}