Common Subsequence
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.
Sample Input
abcfbc abfcab programming contest abcd mnp
Sample Output
4 2 0
题解:求两个字符串s,t的最长公共子序列,dp[i][j]表示匹配到s[i]与t[j]位置时,最长公共子序列的长度。当s[i]=t[j]时,
dp[i][j]=dp[i-1][j-1]+1;否则,dp[i][j]=max{dp[i-1][j],dp[i][j-1]}。
空间复杂度优化:注意到递推公式中得到当前状态只需要上一行的记录,因此,可以利用滚动数组保存两行的状态即可。
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define N 1005
int dp[N][N];
int main()
{
int i,j,n1,n2;
char s1[N],s2[N];
while(scanf("%s%s",s1,s2)!=EOF)
{
n1=strlen(s1);
n2=strlen(s2);
memset(dp,0,sizeof(dp));
for(i=1; i<=n1; i++)
for(j=1; j<=n2; j++)
{
if(s1[i-1]==s2[j-1]) //i=0,j=0时初始化为0为递推做准备
dp[i][j]=dp[i-1][j-1]+1; //dp[i][j]记录str[i-1]和s[j-1]的相同子序列
else
dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
}
printf("%d\n",dp[n1][n2]);
}
return 0;
}