HDU1159 && POJ1458 Common Subsequence (LCS)

最新推荐文章于 2018-03-16 21:35:13 发布

原创最新推荐文章于 2018-03-16 21:35:13 发布 · 326 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

ACM 同时被 3 个专栏收录

261 篇文章

订阅专栏

POJ

70 篇文章

订阅专栏

33 篇文章

订阅专栏

本文介绍了一道经典的最长公共子序列问题，并提供了一个简洁的动态规划解决方案。通过样例输入输出展示了如何找到两个字符串间的最大长度公共子序列。

Common Subsequence

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 36610 Accepted Submission(s): 16755

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

Source

Southeastern Europe 2003

一道最长公共子序列模板题

最长公共子序列问题讲解：http://blog.csdn.net/i1020/article/details/54918665

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string.h>
#include <algorithm>
using namespace std;

int dp[1005][1005];

int main(){
	char str1[1005],str2[1005];
	
	while(~scanf("%s%s",str1,str2)){		
		int len1 = strlen(str1),len2 = strlen(str2);
		
		memset(dp,0,sizeof(dp));
		for(int i = 1; i <= len1; i ++)
			for(int 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;
}