题目:
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, x
ij = 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
这是一道求最长公共子序列的水题,用num[ i ][ j ]数组来存取第一个字符串第i个字符以前的字符串和第二个字符串第j个字符以前的字符串的最长公共子序列,因此可以得出递推式:当字符串一的第i个字符和字符串二的第j个字符相等时,num[i][j]=num[i-1][j-1]+1; 当其不等时:num[i][j]= num[i][j-1]>=num[i-1][j]) ? num[i][j-1] : num[i][j]=num[i-1][j];
以下是AC代码:
#include<stdio.h>
#include<iostream>
#include<string>
using namespace std;
int main()
{
string st1,st2;
while(cin>>st1)
{
int num[500][500]={{0}};
cin>>st2;
for(int i=1;i<=st1.length();i++)
{
for(int j=1;j<=st2.length();j++)
{
if(st1[i-1]==st2[j-1])
{
num[i][j]=num[i-1][j-1]+1;
}
else
{
if(num[i][j-1]>=num[i-1][j])
num[i][j]=num[i][j-1];
else
num[i][j]=num[i-1][j];
}
}
}
cout<<num[st1.length()][st2.length()] <<endl;
}
return 0;
}