Common Subsequence （POJ1458) dp

最新推荐文章于 2022-03-16 21:38:14 发布

JeromeYChen

最新推荐文章于 2022-03-16 21:38:14 发布

阅读量192

点赞数

分类专栏：数据结构与算法

本文链接：https://blog.csdn.net/Jerome_Chen_Y/article/details/106027563

版权

数据结构与算法专栏收录该内容

42 篇文章 0 订阅

订阅专栏

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

题解：
简单题意：最大公共子序列
dp思路：
先想好边界，任意一字串为0则答案为0
再想状态，每个位置a[0-i][0-j] 都有对应答案
思考化成小问题，思考递推
遇到相同的，则之前的加1
遇到不同的，则必是取之前的
看代码

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>

using namespace std;

char str1[1010] = {0,};
char str2[1010] = {0,};
int maxlen[1010][1010] = {0,};

int main()
{
	while(cin >> str1 >> str2)
	{
		int length1 = strlen(str1);
		int length2 = strlen(str2);
		
		//初始化边界 
		for(int i = 0; i <= length1; i++)
			maxlen[i][0] = 0;
		for(int j = 0; j <= length2; j++)
			maxlen[0][j] = 0;
		
		//在str1和str2中挨个对比，在maxlen状态二维表里记录每个位置最大值 
		for(int i = 1; i <= length1; i++)
			for(int j = 1; j <= length2; j++)
				if(str1[i - 1] == str2[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 << maxlen[length1][length2] << endl;
	}

	return 0;
}