HDU1159 && POJ1458:Common Subsequence(LCS)
2016-04-02 22:21
811 查看
[align=left]Problem Description[/align]
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.
[align=left]Sample Input[/align]
abcfbc abfcab programming contest abcd mnp
[align=left]Sample Output[/align]
4 2 0
//入门级问题,算法导论上很详细
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.
[align=left]Sample Input[/align]
abcfbc abfcab programming contest abcd mnp
[align=left]Sample Output[/align]
4 2 0
//入门级问题,算法导论上很详细
#include <iostream> #include <cstdio> #include <cstring> #include <cmath> using namespace std; char str1[1005],str2[1005]; int len1,len2; int dp[1005][1005]; void LCS() { 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]); } } } int main() { while(cin>>str1>>str2) { LCS(); cout<<dp[strlen(str1)][strlen(str2)]<<endl; } return 0; }
相关文章推荐
- 基于WindowsIocp及Duilib的服务器
- Android UI基础——CheckBox&RadioButton控件
- poj 2533 Longest Ordered Subsequence(LIS)
- UI控件--上下文Menu
- 苹果开发工具:Xcode和Interface Builder
- IOS 使用Interface Builder开发界面入门与技巧
- UI控件--PopWindow
- 第63课:Spark SQL下Parquet内幕深度解密学习笔记
- HD 1159 Common Subsequence (最长公共子序列)
- UI控件--AlertDialog
- Android引导动画库:TourGuide
- POJ 1679 The Unique MST 次小生成树
- POJ 1679 The Unique MST 次小生成树
- 第62课:SparkSQL下的Parquet使用最佳实践和代码实践学习笔记
- ubuntu――How to Install MySQL GUI
- 95. Unique Binary Search Trees II
- LC60 Permutation Sequence
- UITableView的介绍及使用
- ubuntu12.04+ros fuerte 跑ORB_SLAM代码
- DuiLib(2)——几种控件的常规属性介绍