Common Subsequence HDU - 1159
Posted 啦啦啦
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了Common Subsequence HDU - 1159相关的知识,希望对你有一定的参考价值。
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.
Input
abcfbc abfcab programming contest abcd mnp
Output
4 2 0
Sample Input
abcfbc abfcab programming contest abcd mnp
Sample Output
4 2 0
1 #include<iostream> 2 #include<algorithm> 3 #include<cstdio> 4 #include<string> 5 #include<cstring> 6 using namespace std; 7 8 string s1; 9 string s2; 10 int dp[1005][1005]; 11 12 int main() 13 { while(cin>>s1>>s2){ 14 int len=s1.size(),lenth=s2.size(),ans=0; 15 memset(dp,0,sizeof(dp)); 16 for(int i=1;i<=len;i++){ 17 for(int j=1;j<=lenth;j++){ 18 if(s1[i-1]==s2[j-1]) dp[i][j]=dp[i-1][j-1]+1; 19 else dp[i][j]=max(dp[i-1][j],dp[i][j-1]); 20 ans=max(ans,dp[i][j]); 21 } 22 } 23 printf("%d\n",ans); 24 } 25 return 0; 26 }
以上是关于Common Subsequence HDU - 1159的主要内容,如果未能解决你的问题,请参考以下文章
hdu 1159 Common Subsequence(lcs)
HDU 1159 Common Subsequence(裸LCS)