题目大意:求两个字符串的最长公共子串。
解题思路:递推公式: s1【i】 = s2【j】 , l【i】[j] = l[i - 1] [j - 1] + 1;
s1【i]】!= s2【j】 , l【i】【j】 = Max (l[i - 1] [j], l[i][j - 1]).
当i和j有一个为0 始,l【i】【j】 = 0;
代码:
#include <cstdio>
#include <cstring>
const int N = 105;
char s1[N], s2[N];
int l[N][N];
int l1, l2;
void init () {
memset (l, 0, sizeof (l));
l1 = strlen(s1);
l2 = strlen(s2);
}
int Max (const int a, const int b) { return a > b? a: b; }
int main () {
int cas = 0;
while (gets(s1) != NULL) {
if (s1[0] == '#')
break;
gets (s2);
init ();
for (int i = 1; i <= l1; i++)
for (int j = 1; j <= l2; j++)
if (s1[i - 1] == s2[j - 1])
l[i][j] = l[i - 1][j - 1] + 1;
else
l[i][j] = Max (l[i][j - 1], l[i - 1][j]);
printf ("Case #%d: you can visit at most %d cities.\n", ++cas, l[l1][l2]);
}
return 0;
}