HDU-1159

最新推荐文章于 2021-05-26 11:46:43 发布

原创最新推荐文章于 2021-05-26 11:46:43 发布 · 362 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#动态规划

算法专栏收录该内容

19 篇文章

订阅专栏

本文介绍了一个经典的计算机科学问题——寻找两个字符串的最长公共子序列，并提供了一段C++实现代码作为示例。该问题通常应用于比较文本相似度、生物信息学等领域。

Problem 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.
The program input is from a text file. Each data set in the file contains two strings representing the given sequences. The sequences are separated by any number of white spaces. The input data are correct. 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


求最长公共子序列的水题
AC代码：
#include
#include
#include
#include
using namespace std;
#define Maxn 1005
char s1[Maxn],s2[Maxn];
int len1,len2;
int Maxlen[Maxn][Maxn];
int main()
{
	//freopen("G:\\text.txt","r",stdin);
	while(cin>>s1>>s2)
	{
		memset(Maxlen,0,sizeof(Maxlen));
		len1=strlen(s1);
		len2=strlen(s2);
		for(int i=0;i<=len1;i++)
		{
			Maxlen[i][0]=0;
		}
		for(int i=0;i<=len2;i++)
		{
			Maxlen[0][i]=0;
		}
		for(int i=1;i<=len1;i++)
		{
			for(int j=1;j<=len2;j++)
			{
				if(s1[i-1]==s2[j-1])
				{
					Maxlen[i][j]=Maxlen[i-1][j-1]+1;
				}
				else
				{
					Maxlen[i][j]=max(Maxlen[i-1][j],Maxlen[i][j-1]);
				}
			}
		}
		cout<