hdu1159Common Subsequence
来源:互联网 发布:老铜器一眼知真假 编辑:程序博客网 时间:2024/06/13 09:08
Common Subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 34460 Accepted Submission(s): 15744
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求两串公共串长度
#include <iostream>#include <cstdio>#include <cstring>using namespace std;int dp[1005][1005];char a[1005],b[1005];int len1,len2;void LCS(){ int i,j; memset(dp,0,sizeof(dp)); for(i=1; i<=len1; i++) for(j=1; j<=len2; j++) { if(a[i-1]==b[j-1]) { dp[i][j]=dp[i-1][j-1]+1; } else { dp[i][j]=max(dp[i-1][j],dp[i][j-1]); } }}int main(){ while(scanf("%s%s",a,b)!=EOF) { len1=strlen(a); len2=strlen(b); LCS(); cout<<dp[len1][len2]<<endl; } return 0;}
Source
Southeastern Europe 2003
0 0
- hdu1159Common Subsequence
- HDU1159Common Subsequence DP
- hdu1159Common Subsequence(DP最长公共递增序列)
- hdu1159Common Subsequence(动态规划之最长公共子序列)
- Subsequence
- Subsequence
- Subsequence
- subsequence
- Subsequence
- Subsequence
- Subsequence
- Subsequence
- Subsequence
- Subsequence
- Subsequence
- Subsequence
- Subsequence
- Subsequence
- gulp教程之gulp-imagemin
- 第四周【项目三-单链表应用(2)链接】
- 【Qzone】入戏太深 第四步 创建一个新的Android产品项目 模拟器版
- Linux学习(CentOS-7)---制作U盘启动盘来安装CentOS-7
- Spark流处理项目介绍
- hdu1159Common Subsequence
- 【Phalcon实现高性能网站】使用Phalcon高性能PHP框架搭建网站 视图之传递参数
- poj 3107 求树的所有重心
- JQuery选择器
- AD/DA的转换
- gulp教程之gulp-htmlmin
- javascript的getElementsByTagName() 方法
- javascript事件绑定的三种方法
- 2016/09/22 一大波华为机考题目来袭