hdu【1159】Common Subsequence 【最长公共子序列】
2017-08-08 16:45
363 查看
Common Subsequence
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 strictlyincreasing sequence < i1, i2, ..., ik > of indices of X such that for all j = 1,2,...,k, x
ij = 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
程序如下:
#include<cstdio> #include<cstring> #include<stack> #include<algorithm> using namespace std; char str1[10001];//main函数里面定义太小,容易越界 char str2[10001]; int dp[10001][10001] = {0}; int main() { while(~scanf ("%s%s",str1+1,str2+1)) { str1[0] = str2[0] = '0'; int l1 = strlen(str1)-1; int l2 = strlen(str2)-1; int i,j; for ( i = 1 ; i <= l1 ; i++) { for (j = 1 ; j <= l2 ; j++) { if (str1[i] == str2[j]) //dp[i-1][j-1]+1 str1[i]==str2[j] dp[i][j] = dp[i-1][j-1] + 1; else dp[i][j] = max(dp[i-1][j],dp[i][j-1]);//max(dp[i-1][j],dp[i][j-1]) str1[i]!=str2[j] } } printf("%d\n",dp[l1][l2]); } return 0; }
相关文章推荐
- HDU 1159 Common Subsequence【dp+最长公共子序列】
- HDU 1159 Common Subsequence(最长公共子序列)
- hdu 1159 Common Subsequence(最长公共子序列)
- hdu 1159 Common Subsequence(最长公共子序列)
- HDU 1159 - Common Subsequence [最长公共子序列]
- HDU 1159 & POJ 1458 Common Subsequence(LCS 最长公共子序列O(nlogn))
- hdu 1159 Common Subsequence(动态规划:最长公共子序列)
- hdu 1159 Common Subsequence (最长公共子序列)
- hdu 1159 Common Subsequence(最长公共子序列问题)
- hdu 1159 Common Subsequence 最长公共子序列
- hdu1159 Common Subsequence 最长公共子序列 经典DP
- Common Subsequence HDU - 1159 (最长公共子序列)
- hdu 1159 Common Subsequence(DP最长公共子序列)
- hdu 1159 Common Subsequence(DP最长公共子序列)
- HDU1159 Common Subsequence【最长公共子序列】
- HDU-1159 Common Subsequence(最长公共子序列)
- HDU 1159 Common Subsequence(最长公共子序列模板题)
- HDU 1159 Common Subsequence 最长公共子序列 详解
- 每日三题-Day4-C(HDU 1159 Common Subsequence 最长公共子序列O(nlogn)解法)
- hdu 1159 Common Subsequence(最长公共子序列)