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>
using namespace std;
const int MAX = 1050;
int N;
int num[MAX][MAX];
int dp[MAX][MAX]; //dp[i][j]表示长为i的字符串s1和长为j的字符串s2的最长公共子序列长度
int solve(string s1, string s2)
{
memset(dp, 0, sizeof(dp));
int len1 = s1.length();
int len2 = s2.length();
for (int i = 0; i < len1; i++)
{
for (int j = 0; j < len2; j++)
{
if (s1[i] == s2[j])
{
if (i == 0 || j == 0)
dp[i][j] = 1;
else
dp[i][j] = dp[i-1][j-1]+1;
}
else
dp[i][j] = max(dp[i-1][j], dp[i][j-1]);
}
}
return dp[len1 - 1][len2 - 1];
}
int main()
{
string s1, s2;
while (cin >> s1 >> s2)
cout << solve(s1, s2) << endl;
return 0;
}