Common Subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23279 Accepted Submission(s): 10242
Problem Description
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.
Sample Input
abcfbc abfcab programming contest abcd mnp
Sample Output
4 2 0
递推式,用滚动数组节省空间,记忆化搜索(会超时爆栈),附上打印路径
——————————————————————————————————————————————
最长公共子序列 LCS
if a[i]==b[j]
dp[i][j]=dp[i-1][j-1]+1;
else
dp[i][j]=max(dp[i-1][j],dp[i][j-1])
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#define M 1000
using namespace std;
int dp[M][M];
int main()
{
char s1[M],s2[M];
while(scanf("%s %s",s1,s2)!=EOF){
memset(dp,0,sizeof dp);
int l1=strlen(s1);
int l2=strlen(s2);
for(int i=1;i<=l1;++i){
for(int j=1;j<=l2;++j){
if(s1[i-1]==s2[j-1]){
dp[i][j]=dp[i-1][j-1]+1;
}
else{
dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
}
}
}
cout<<dp[l1][l2]<<endl;
}
return 0;
}
——————————————————————————————————————————————————————————————————
滚动数组:
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#define M 1000
using namespace std;
int dp[2][M];
int main()
{
char s1[M],s2[M];
while(scanf("%s %s",s1,s2)!=EOF){
memset(dp,0,sizeof dp);
int l1=strlen(s1);
int l2=strlen(s2);
for(int i=1;i<=l1;++i){
for(int j=1;j<=l2;++j){
if(s1[i-1]==s2[j-1]){
dp[i%2][j]=dp[(i-1)%2][j-1]+1;
}
else{
dp[i%2][j]=max(dp[(i-1)%2][j],dp[i%2][j-1]);
}
}
}
cout<<dp[l1%2][l2]<<endl;
}
return 0;
}
——————————————————————————————————————————————————
随便写的记忆化搜索,但是肯定会超时爆栈
#include<iostream>
#include<cstring>
#include<cstdio>
#define M 10001
using namespace std;
char s1[M],s2[M];
int dp[M][M];
int solve(int x,int y)
{
if(!x||!y) return 0;
int& ans=dp[x][y];
if(ans>0) return ans;
if(s1[x-1]==s2[y-1]) ans=solve(x-1,y-1)+1;
else ans=max(solve(x-1,y),solve(x,y-1));
return ans;
}
int main()
{
while(scanf("%s %s",s1,s2)!=EOF){
memset(dp,0,sizeof dp);
int la=strlen(s1);
int lb=strlen(s2);
cout<<solve(la,lb)<<endl;
}
return 0;
}
——————————————————————————————————
打印路径
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#define M 1000
using namespace std;
int dp[M][M],fa[M][M];
char s1[M],s2[M];
void print(int i,int j) //打印路径
{
if(!i||!j) return;
if(fa[i][j]==0){
--i,--j;
print(i,j);
putchar(s1[i]);
}
else if(fa[i][j]==1) {
--i;
print(i,j);
}
else {
--j;
print(i,j);
}
}
int main()
{
while(scanf("%s %s",s1,s2)!=EOF){
memset(dp,0,sizeof dp);
int l1=strlen(s1);
int l2=strlen(s2);
for(int i=1;i<=l1;++i){
for(int j=1;j<=l2;++j){
if(s1[i-1]==s2[j-1]){
fa[i][j]=0;
dp[i][j]=dp[i-1][j-1]+1;
}
else{
if(dp[i-1][j]>dp[i][j-1]){
dp[i][j]=dp[i-1][j];
fa[i][j]=1;
}
else{
dp[i][j]=dp[i][j-1];
fa[i][j]=-1;
}
}
}
}
cout<<dp[l1][l2]<<endl;
// print(l1,l2);
}
return 0;
}