题意:
字符版的最长公共子序列
样例如下:
Sample Input
bcacbcabbaccbab
bccabccbbabacbc
a1b2c3d4e
zz1yy2xx3ww4vv
abcdgh
aedfhr
abcdefghijklmnopqrstuvwxyz
a0b0c0d0e0f0g0h0i0j0k0l0m0n0o0p0q0r0s0t0u0v0w0x0y0z0
abcdefghijklmnzyxwvutsrqpo
opqrstuvwxyzabcdefghijklmn
Sample Output
11
4
3
26
14
思路:
写这题的时候发现uva111做错了(虽然AC),第一个样例跑出来是16,调了一下,发现之前理解的思路有误,附上两张对比图
首先是错误的做法
/*
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
if (a[i] == b[j])
dp[i][j] ++;
}
}
*/
将dp打印,如图:
然后是正确代码:
/*
for (int i = 1; i <= la; i++) {
for (int j = 1; j <= lb; j++) {
if (A[i - 1] == B[j - 1]) {
dp[i][j] = dp[i - 1][j - 1] + 1;
}
else
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
}
*/
打印dp,如图:
经对比后,很快发现,错误代码中对相等字符串做了多余的累加,从图中第一行,错误代码存在2就可看出。
好了,
代码如下:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1005;
char A[N], B[N];
int dp[N][N];
int main() {
//while(~scanf("%s%s",A,B)) { //这样会wa,因为输入的字符之间可能含空格,而scanf遇空格停止,而题目中未提到,->_->好坑!
while (gets(A)&&gets(B)) {
int la = strlen(A), lb = strlen(B);
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= la; i++) {
for (int j = 1; j <= lb; j++) {
if (A[i - 1] == B[j - 1]) {
dp[i][j] = dp[i - 1][j - 1] + 1;
}
else
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
}
}
printf("%d\n", dp[la][lb]);
}
return 0;
}