Common Subsequence
题目大意:
多组数据,每组两个串,求最长公共子序列。
解题思路:
dp[i][j]代表,第一个串的前i个字符和第二个串的前j个字符的最长公共子序列,那么
当a[i]==b[j]时,dp[i][j]=max(dp[i][j],dp[i−1][j−1]+1);
当
a
[
i
]
==
b
[
j
]
时
,
d
p
[
i
]
[
j
]
=
m
a
x
(
d
p
[
i
]
[
j
]
,
d
p
[
i
−
1
]
[
j
−
1
]
+
1
)
;
当a[i]!=b[j]时,dp[i][j]=max(dp[i][j],max(dp[i−1][j],dp[i][j−1]));
当
a
[
i
]
!
=
b
[
j
]
时
,
d
p
[
i
]
[
j
]
=
m
a
x
(
d
p
[
i
]
[
j
]
,
m
a
x
(
d
p
[
i
−
1
]
[
j
]
,
d
p
[
i
]
[
j
−
1
]
)
)
;
AC代码:
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
using namespace std;
const int maxn = 1000;
int dp[maxn + 5][maxn + 5];
char a[maxn + 5], b[maxn + 5];
int main() {
while(scanf("%s%s", a + 1, b + 1) != EOF) {
memset(dp, 0, sizeof(dp));
int len1 = strlen(a + 1);
int len2 = strlen(b + 1);
for(int i = 1; i <= len1; i++)
for(int j = 1; j <= len2; j++) {
if(a[i] == b[j])dp[i][j] = max(dp[i][j], dp[i - 1][j - 1] + 1);
else dp[i][j] = max(dp[i][j], max(dp[i - 1][j], dp[i][j - 1]));
}
printf("%d\n", dp[len1][len2]);
}
return 0;
}