# poj1458 Common Subsequence (dp,最长公共子序列）

http://poj.org/problem?id=1458

Common Subsequence
 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 46650 Accepted: 19171

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

Source

AC代码如下：

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<set>
#include<cmath>
#include<vector>
#include<map>
using namespace std;
typedef long long ll;
const int maxn  = 1010;
char str1[maxn];
char str2[maxn];
int dp[maxn][maxn];
int main()
{
while(~scanf("%s%s",str1,str2))
{
int len1 = strlen(str1);
int len2 = strlen(str2);
memset(dp,0,sizeof(dp));
for(int i = 0 ; i < len1; i++)
for(int j = 0; j < len2; j++)
{
dp[i+1][j+1] = dp[i][j];
if(str1[i]==str2[j])
dp[i+1][j+1] = dp[i][j] + 1;
else
dp[i+1][j+1] = max(dp[i+1][j],dp[i][j+1]);
}
cout << dp[len1][len2]<<endl;
}

return 0 ;
}


• 本文已收录于以下专栏：

举报原因： 您举报文章：poj1458 Common Subsequence (dp,最长公共子序列） 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)