hdu 1159 Common Subsequence (求LCS的长度)
来源:互联网 发布:网站源码获取 编辑:程序博客网 时间:2024/06/07 19:42
Common Subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24469 Accepted Submission(s): 10812
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.
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 abfcabprogramming contest abcd mnp
Sample Output
420解法可参考《算法导论》第二版P210#include<cstdio>#include<iostream>#include<cstring>using namespace std;char str1[1000],str2[1000];int dp[1000][1000];int max(int a,int b){ return a>b?a:b;}int main(){ int len1,len2; while(scanf("%s%s",str1,str2)==2) { memset(dp,0,sizeof(dp)); len1=strlen(str1); len2=strlen(str2); for(int i=0; i<=len1; i++) dp[i][0]=0; for(int j=0; j<=len2; j++) dp[0][j]=0; for(int i=0; i<len1; i++) for(int j=0; j<len2; j++) { if(str1[i]==str2[j]) dp[i+1][j+1]=dp[i][j]+1; else dp[i+1][j+1]=max(dp[i+1][j],dp[i][j+1]); } /*cout<<"debug:"<<endl; for(int i=0; i<=len1; i++) for(int j=0; j<=len2; j++) { if(j==len2) cout<<dp[i][j]<<endl; else cout<<dp[i][j]<<" "; }*/ printf("%d\n",dp[len1][len2]); memset(str1,0,sizeof(str1)); memset(str2,0,sizeof(str2)); } return 0;}
0 0
- 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(dp LCS)
- 【HDU】-1159-Common Subsequence(LCS,模板)
- HDU 1159 Common Subsequence(LCS)
- 【HDU】1159 - Common Subsequence(LCS)
- hdu 1159 Common Subsequence (LCS)
- HDU 1159 Common Subsequence【LCS(dp)】
- 【hdu 1159】Common Subsequence(LCS模板)
- Common Subsequence (lcs)【HDU】-1159
- HDU 1159 Common Subsequence(LCS)
- hdu 1159 Common Subsequence (LCS)
- HDU 1159 Common Subsequence(LCS)
- hdu 1159 Common Subsequence(LCS)
- HDU 1159 Common Subsequence【LCS】
- hdu 1159 Common Subsequence (lcs)
- mybatis源码阅读心得
- 在 github 上获取源码
- 排列逆序数和计算
- iOS程序性能优化
- java.util.Scanner应用详解
- hdu 1159 Common Subsequence (求LCS的长度)
- 凌度多功能后视镜行车记录仪HS850B 多重守护行车安全
- 压缩和解压缩ZIP文件
- HBase总结(十九)数据导入方式
- LEETCODE: Reverse Nodes in k-Group
- unity之增删改查
- 【POJ 2104】K-th Number
- VS2012配置中使用C++调用Python
- nyoj-484-The Famous Clock