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.
Input
The program input is from the std input. Each data set in the input contains two strings representing the given sequences. The sequences are separated by any number of white spaces. The input data are correct.
Output
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
思路
f[i][j]表示s1的第i位之前和s2的第j位之前的最长公共子序列数
如果s1第i为和s2的第j位相同,那么f[i][j]就等于s1的第i-1位和s2的j-1位对应的最长共子序列数加一;如果不同f[i][j]就继承f[i-1][j]和f[i][j-1]中较大的一个
注意字符串下标从0开始
转移方程
if(s1[i]==s2[j])
f[i+1][j+1]=f[i][j]+1;
else
f[i+1][j+1]=max(f[i][j+1],f[i+1][j]);
代码
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int f[1001][1001];
int main()
{
string s1,s2;
while(cin>>s1)
{
cin>>s2;
int len1=s1.length(),len2=s2.length();
for(int i=0;i<len1;i++)
for(int j=0;j<len2;j++)
{
if(s1[i]==s2[j])
f[i+1][j+1]=f[i][j]+1;
else
f[i+1][j+1]=max(f[i][j+1],f[i+1][j]);
}
cout<<f[len1][len2]<<endl;
}
return 0;
}