Longest Common Subsequence
Sequence 1:
Sequence 2:
Given two sequences of characters, print the length of the longest common subsequence of both sequences. For example, the longest common subsequence of the following two sequences:
abcdgh aedfhris adh of length 3.
Input consists of pairs of lines. The first line of a pair contains the first string and the second line contains the second string. Each string is on a separate line and consists of at most 1,000 characters
For each subsequent pair of input lines, output a line containing one integer number which satisfies the criteria stated above.
Sample input
a1b2c3d4e zz1yy2xx3ww4vv abcdgh aedfhr abcdefghijklmnopqrstuvwxyz a0b0c0d0e0f0g0h0i0j0k0l0m0n0o0p0q0r0s0t0u0v0w0x0y0z0 abcdefghijklmnzyxwvutsrqpo opqrstuvwxyzabcdefghijklmn
Output for the sample input
4 3 26 14
题意:求最长公共子序列的长度。
思路:注意一行是一个字符串,所以存在空格,要用gets(str)。
AC代码如下:
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
char s1[1010],s2[1010];
int dp[1010][1010];
int main()
{ int n,i,j,k,len1,len2;
while(gets(s1))
{ gets(s2);
len1=strlen(s1);
len2=strlen(s2);
for(i=1;i<=len1;i++)
for(j=1;j<=len2;j++)
{ dp[i][j]=max(dp[i][j-1],dp[i-1][j]);
if(s1[i-1]==s2[j-1])
dp[i][j]=max(dp[i][j],dp[i-1][j-1]+1);
}
printf("%d\n",dp[len1][len2]);
}
}