hdu 1159 Common Subsequence(LCS)
来源:互联网 发布:鬼笔鹅膏 知乎 编辑:程序博客网 时间:2024/05/01 06:16
Common Subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22623 Accepted Submission(s): 9928
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求两个字符串的最长公共子序列,即LCS。经典的DP DP方程:dp[i][j]=dp[i-1][j-1]+1 (s1[i-1]==s2[j-1])dp[i][j]=max(dp[i][j-1],dp[j][i-1]) (s1[i-1]!=s2[j-1])dp[len1][len2]即为最终的匹配长度。#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;char s1[1024],s2[1024];int dp[1024][1024];int main(){ //freopen("in.txt","r",stdin); while(scanf("%s %s",s1,s2)!=EOF) { memset(dp,0,sizeof(dp)); int len1=strlen(s1); int len2=strlen(s2); for(int i=1;i<=len1;i++) { for(int j=1;j<=len2;j++) { if(s1[i-1]==s2[j-1]) 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;}
0 0
- 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)
- 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)
- hdu 1159 Common Subsequence 【LCS 基础入门】
- hdu 1159 && poj 1458 Common Subsequence (LCS)
- HDU 1159 Common Subsequence(DP,LCS)
- hdu 1159 Common Subsequence(LCS,dp)
- HDU - 1159 Common Subsequence (简单LCS)
- HDU 1159 Common Subsequence(dp LCS)
- 玻璃纤维起着至关重要的作用在科学和工业
- The Dole Queue
- 玻璃破碎玻璃破碎机玻璃回收厂
- 非官方的飒飒
- opencv用haartraining训练出现的一些问题
- hdu 1159 Common Subsequence(LCS)
- 层次任务分析
- 时间编程和实现原理
- android 分享功能 总汇
- 微软保密新政:外用工服务一年半就暂停
- Java Singleton 单例模式思考
- 玻璃性质的计算
- Ubuntu13.04安装配置 tftp 服务方法
- 《Spring3.X企业应用开发实战》学习笔记--DAO和事务