题目:
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
递归公式:
代码:
#include<iostream>
#include<string.h>
#include<stdio.h>
//c[i][j]表示a长度i,b长度j的最长公共子序列的长度
using namespace std;
char x[1000],y[1000];
int c[1000][1000];//全局变量默认0
int main(){
while(cin>>x>>y){
int i,j;
int lenx=strlen(x);
int leny=strlen(y);
for(i=0;i<=lenx;i++) c[i][0]=0;
for(i=0;i<=leny;i++) c[0][i]=0;
for(i=1;i<=lenx;i++){
for(j=1;j<=leny;j++){
if(x[i-1]==y[j-1]) c[i][j]=c[i-1][j-1]+1;
else if(c[i-1][j]>c[i][j-1]) c[i][j]=c[i-1][j];
else c[i][j]=c[i][j-1];
}
}
cout<<c[lenx][leny]<<endl;
}
return 0;
}
递归代码:
#include<iostream>
#include<string.h>
#include<algorithm>//max
using namespace std;
char a[1000], b[1000];
int s[1000][1000];
int dp(int x, int y)
{
if (x == 0 || y == 0) return 0;
if (a[x - 1] == b[y - 1]) return dp(x - 1, y - 1) + 1;
else return max(dp(x - 1, y), dp(x, y - 1));
}
int main()
{
while (cin >> a >> b)
{
int lena = strlen(a), lenb = strlen(b);
cout << dp(lena, lenb) << endl;
}
return 0;
}
备忘录方法:(非常好用)
#include<iostream>
#include<string.h>
using namespace std;
char a[1000], b[1000];
int s[1000][1000];//备忘录
int dp(int x, int y)
{
if (x < 0 || y < 0) return 0;//递归退出条件
if (s[x][y] >= 0) return s[x][y];//备忘录退出条件
s[x ][y ] = dp(x, y - 1);//递归表达式
if (dp(x - 1, y) > dp(x, y - 1)) s[x][y] = dp(x - 1, y);
if (a[x] == b[y]) s[x][y] = dp(x - 1, y - 1) + 1;//最优情况放在最后,有可能三状况
return s[x][y];//与函数相对应
}
int main()
{
while (cin >> a >> b)
{
memset(s, -1, sizeof(s));
int lena = strlen(a), lenb = strlen(b);
cout << dp(lena - 1, lenb - 1) << endl;
}
return 0;
}