Common Subsequence POJ - 1458 dp lcs

题解

数据量很小 可以N^2使用最长公共子序列直接求解

AC代码

#include <stdio.h>
#include <iostream>
#include <string.h>
using namespace std;
typedef long long ll;

const int INF = 0x3f3f3f3f;
const int MAXN = 1e3 + 10;
char a[MAXN], b[MAXN];
int d[MAXN][MAXN];

int main()
{
#ifdef LOCAL
	freopen("C:/input.txt", "r", stdin);
#endif
    while (scanf("%s%s", a + 1, b + 1) != EOF)
    {
        memset(d, 0, sizeof(d));
        int n = strlen(a + 1);
        int m = strlen(b + 1);
        for (int i = 1; i <= n; i++)
            for (int j = 1 ; j <= m; j++)
                if (a[i] == b[j])
                    d[i][j] = d[i - 1][j - 1] + 1;
                else
                    d[i][j] = max(d[i - 1][j], d[i][j - 1]);
        cout << d[n][m] << endl;
    }

	return 0;
}