POJ：1458 Common Subsequence（LCS）

最新推荐文章于 2018-07-25 21:27:17 发布

zugofn

最新推荐文章于 2018-07-25 21:27:17 发布

阅读量289

点赞数

分类专栏： LCS 最长公共子序列文章标签： LCS 最长公共子序列贪心 dp 动态规划

本文链接：https://blog.csdn.net/zugofn/article/details/52198003

版权

LCS 同时被 2 个专栏收录

4 篇文章 0 订阅

订阅专栏

最长公共子序列

3 篇文章 0 订阅

订阅专栏

Common Subsequence

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 47946		Accepted: 19749

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 _{i_j} = 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

Southeastern Europe 2003

题目大意：求最长公共子序列的长度。

解题思路：LCS裸题。

代码如下：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
char s1[1010],s2[1010];
int dp[1010][1010];
int main()
{
	while(scanf("%s %s",s1,s2)!=EOF)
	{
		int len1=strlen(s1);
		int len2=strlen(s2);
		memset(dp,0,sizeof(dp));
		for(int i=1;i<=len1;i++)
		{
			for(int j=1;j<=len2;j++)
			{
				if(s1[i-1]==s2[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;
}