Common Subsequence
A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = <x1, x2, ..., xm> another sequence Z = <z1, z2, ..., zk> is a subsequence of X if there exists a strictly increasing sequence <i1, i2, ..., ik> of indices of X such that for all j = 1,2,...,k, xij = zj. For example, Z = <a, b, f, c> is a subsequence of X = <a, b, c, f, b, c> with index sequence <1, 2, 4, 6>. Given two sequences X and Y the problem is to find the length of the maximum-length common subsequence of X and Y.
The program input is from a text file. Each data set in the file contains two strings representing the given sequences. The sequences are separated by any number of white spaces. The input data are correct. For each set of data the program prints on the standard output the length of the maximum-length common subsequence from the beginning of a separate line.
The program input is from a text file. Each data set in the file contains two strings representing the given sequences. The sequences are separated by any number of white spaces. The input data are correct. For each set of data the program prints on the standard output the length of the maximum-length common subsequence from the beginning of a separate line.
Input
abcfbc abfcab
programming contest
abcd mnp
Output
4
2
0
Sample Input
abcfbc abfcab
programming contest
abcd mnp
Sample Output
4
2
0
思路:
用dp[ ][ ]记录当前状态下的最优解。
研究当前考虑字串的最后一个字符,如果s1[i]=s2[j],那么最长子序列的长度应当为之前最长子序列+1,当s1[i]!=s2[j]时,最长子序列有两种可能,一种为:s1[i]与s2[j+1]的公共子序列,另一种为s1[i+1]与s2[j]的公共子序列,那么此时s1[i]与s2[j]的最长公共子序列应当为所说两种情况中较长的那个。
AC代码:
#include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
#include<cmath>
#define maxn 505
using namespace std;
int main()
{
int len1,len2,i,j,dp[maxn][maxn]; //dp数组用来记录当前状态最优解
char s1[maxn],s2[maxn],lc_str[maxn];
while(scanf("%s%s",s1,s2)!=EOF){
memset(dp,0,sizeof(dp));
len1=strlen(s1);
len2=strlen(s2);
for(i=0;i<len1;++i){
for(j=0;j<len2;++j){
if(s1[i]==s2[j]){
dp[i+1][j+1]=dp[i][j]+1;
}
else{
dp[i+1][j+1]=max(dp[i][j+1],dp[i+1][j]);
}
}
}
cout<<dp[len1][len2]<<endl;
//输出最长公共子串
/* int k = dp[len1][len2];
lc_str[k] = '\0';
while(k > 0){
if(dp[len1][len2] == dp[len1-1][len2]) len1--;
else if(dp[len1][len2] == dp[len1][len2-1]) len2--;
else{
lc_str[--k] = s1[len1-1];
len1--;
len2--;
}
}
printf("%s\n",lc_str);*/
}
return 0;
}