基础动态规划题。
设dp[i+1][j+1]表示截止s1[i], s2[j]为止的最大公共子序列长度。
若s1[i] == s2[j],有 dp[i+1][j+1] = dp[i][j] + 1
否则,有 dp[i+1][j+1] = max(dp[i][j+1], dp[i+1][j])
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
const int MAXN = 1000;
int dp[MAXN][MAXN];
int main()
{
string s1, s2;
while (cin >> s1 >> s2)
{
memset(dp, 0, sizeof(dp));
int len1 = s1.length();
int len2 = s2.length();
for (int i = 0; i < len1; i++)
{
for (int j = 0; j < len2; j++)
{
if (s1[i] == s2[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]);
}
}
cout << dp[len1][len2] << endl;
}
return 0;
}
继续加油。