# poj1458Common Subsequence(求两个字符串的最长公共子序列)

Common Subsequence
 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 44296 Accepted: 18108

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

//poj-Common Subsequence(求两个字符串的最长公共子序列)
#include<stdio.h>
#include<string.h>
char str1[1010],str2[1010];
int dp[1010][1010];
int max(int a,int b){
if(a>b)  return a;
else     return b;
}
int main()
{
int len1,len2,i,j;
while(scanf("%s%s",str1,str2)!=EOF){

len1=strlen(str1);
len2=strlen(str2);
memset(dp,0,sizeof(dp));
for(i=1;i<=len1;i++)
for(j=1;j<=len2;j++)
{
if(str1[i-1]==str2[j-1])
dp[i][j]=dp[i-1][j-1]+1;
else
dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
}
printf("%d\n",dp[len1][len2]);
}
return 0;
}


#### 【算法导论学习-29】动态规划经典问题02：最长公共子序列问题（Longest common subsequence，LCS）

2014-09-03 21:42:19

#### 【LeetCode】Longest Common Subsequence最长公共子序列（求出某一解+LCS长度） - Medium

2017-09-09 09:12:00

#### python实现Longest Common Subsequence最长公共子序列算法

2017-07-06 11:20:20

#### 最长公共子序列求解问题

2009年07月04日 2.28MB 下载

#### 两字符串最长公共子序列--动态规划

2016-10-15 17:51:04

#### 递归与动态规划---最长公共子序列问题

2017-08-13 20:55:21

#### 求两个字符串最长公共子序列的算法优化（C++实现）

2014-06-10 22:47:48

#### 动态规划：求最长公共子串/最长公共子序列

2015-04-30 11:30:58

#### 求两个字符串的最长公共子序列

2013-09-23 23:31:04

#### 小白算法学习：求解两个字符串的最长公共子序列

2017-03-23 21:30:05