hdu 1159 Common Subsequence(lcs)
2017-04-20 15:59
260 查看
Common Subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 38003 Accepted Submission(s): 17422
[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
最长公共子序列
#include <iostream> #include <cstdio> #include <cstring> using namespace std; const int MAXN = 512; int dp[MAXN][MAXN]; int main() { char s1[MAXN], s2[MAXN]; int i, j; int len1, len2; while (~scanf("%s%s", s1 + 1, s2 + 1)) { len1 = strlen(s1 + 1); len2 = strlen(s2 + 1); memset(dp, 0, sizeof(dp)); for (i = 1; i <= len1; ++i) { for (j = 1; j <= len2; ++j) { if (s1[i] == s2[j]) { 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; }
相关文章推荐
- hdu 1159 && poj 1458 Common Subsequence (LCS)
- HDU 1159 Common Subsequence(LCS)
- hdu 1159 Common Subsequence(LCS)
- HDU1159-Common Subsequence-LCS
- Common Subsequence HDU - 1159 (lcs简单dp)
- POJ 1458 && HDU 1159 Common Subsequence(LCS)
- HDU 1159 Common Subsequence (线性dp 裸LCS)
- HDU 1159 Common Subsequence(LCS 模板题)
- 【hdu 1159】Common Subsequence(LCS模板)
- hdu 1159 Common Subsequence (LCS)
- hdu 1159 Common Subsequence(LCS,dp)
- HDU1159 && POJ1458 Common Subsequence (LCS)
- 【HDU1159】Common Subsequence(LCS/DP)
- HDU 1159 Common Subsequence(LCS)
- hdu 1159 Common Subsequence_LCS(最长公共子序列)
- Hdu1159-Common Subsequence-【LCS】
- HDU 1159 Common Subsequence(LCS)
- hdu 1159 Common Subsequence(LCS最长公共子序列)
- 【HDU】1159 - Common Subsequence(LCS)
- HDU 1159 Common Subsequence (动态规划LCS)