题意:求两字符串的最长公共子序列(LCS)
思路:取dp[i][j]为s1的前i个字符和s2的前j个字符的最大公共子序列长度,则当前字符相等时长度为前面的长度加1,不相等则长度为之前的最大长度
#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
using namespace std;
const int maxn = 1005;
string s1, s2;
int dp[maxn][maxn];
int main()
{
while (cin >> s1 >> s2) {
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= s1.length(); i++)
for (int j = 1; j <= s2.length(); j++)
if (s1[i-1] == s2[j-1])
dp[i][j] = dp[i-1][j-1] + 1;
else
dp[i][j] = max(dp[i][j-1], dp[i-1][j]);
cout << dp[s1.length()][s2.length()] << endl;
}
}