假如使 dp[ i ][ j ] : = s1.... si 和 t1 ... tj对应的LCS的长度;
由此, s1 ... si + 1 和 t1 ... t j + 1 对应的公共子列可能是
** 当 s i +1 = ti+ 1时, 在s1...和t1...tj的公共子列末尾追加上si+1;
** s1...si和t1...tj+1的公共子列
** s1...si+1 和t1..tj的公共子列
模板:
#include<bits/stdc++.h>
using namespace std;
#define EPS 1e-7
#define clr(x) memset(x, 0, sizeof(x))
#define long long ll
#define double db
#define PI acos(-1.0)
const int INF = 0x3f3f3f3f;
const int MOD=1000000007;
const int MAXN = 10000000;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, 1, -1};
const int MAXX = 10005;
int n, m, dp[MAXX][MAXX];
char str1[MAXX];
char str2[MAXX];
int main()
{
while(~scanf("%d %d", &n, &m))
{
scanf("%s %s", str1, str2);
clr(dp);
for(int i = 0; i < n; i++)
for(int j = 0; j < m; j++)
{
if(str1[i] == str2[j])
dp[i + 1][j + 1] = dp[i][j] + 1;
else
dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j]);
}
printf("%d\n", dp[n][m]);
}
}