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
题目大意
求两个字符串最长公共子序列的长度。子序列是指一个序列删除若干元素后得到的序列。例如ABCDE,ACE、AD都是其子序列
求X={x1, x2,…, }和Y={y1, y2,…,
}的最长公共子序列,递推: 当
=
时,找出
和
的最长公共子序列,然后在其尾部加上
即可得到X和Y的最长公共子序列; 当
≠
时,求解两个子问题:(1)找出
和
的最长公共子序列;(2)
和
的最长公共子序列,这两个公共子序列中的较长者即为X和Y的最长公共子序列。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
string s1,s2;
int dp[1000][1000];
int f()
{
memset(dp,0,sizeof(dp));
for(int i=1;i<=s1.size();i++)
{
for(int j=1;j<=s2.size();j++){
if(s1[i-1]==s2[j-1]) dp[i][j] = dp[i-1][j-1] + 1;
else dp[i][j] = max(dp[i][j-1],dp[i-1][j]);
}
}
return dp[s1.size()][s2.size()];
}
int main()
{
while(cin>>s1>>s2)
cout<<f()<<endl;
return 0;
}