hdu 1159 Common Subsequence 最长公共子序列
来源:互联网 发布:淘宝宝贝编辑助手 编辑:程序博客网 时间:2024/06/05 18:44
题目描述:
Common Subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13970 Accepted Submission(s): 5758
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
Source
Southeastern Europe 2003
目测是最常公共子序列。。。。。
附上代码:
目测是最常公共子序列。。。。。
附上代码:
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<vector>#include<set>#include<cstdlib>#define BUG puts("ok");#define CLR(a,b) memset((a),(b),sizeof((a)))#define inf 16843009using namespace std;int const nMax=1010;typedef long long LL;char a[nMax],b[nMax];int dp[nMax][nMax];int main(){ while(~scanf("%s%s",a+1,b+1)) { // printf("%s %s\n",a+1,b+1); int la=strlen(a+1),lb=strlen(b+1); CLR(dp,0); for(int i=1;a[i];i++){ for(int j=1;b[j];j++){ if(a[i]==b[j])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[la][lb]); } return 0;}
- HDU Common Subsequence 最长公共子序列
- HDU Common Subsequence(最长公共子序列)
- hdu 1159 Common Subsequence ***poj1458(最长公共子序列)
- hdu 1159 Common Subsequence 最长公共子序列
- hdu 1159 Common Subsequence(DP最长公共子序列)
- HDU 1159 Common Subsequence 最长公共子序列
- HDU 1159 Common Subsequence--最长公共子序列
- hdu 1159 Common Subsequence (最长公共子序列)
- Common Subsequence 最长公共子序列 hdu 1159
- hdu 1159 Common Subsequence(LCS最长公共子序列)
- hdu 1159 Common Subsequence(最长公共子序列)
- hdu 1159 Common Subsequence(动态规划:最长公共子序列)
- HDU 1159 Common Subsequence (动规+最长公共子序列)
- HDU 1159:Common Subsequence(最长公共子序列)
- 最长公共子序列DP Common Subsequence HDU 1159
- hdu 1159 Common Subsequence(最长公共子序列)
- HDU 1159 Common Subsequence(最长公共子序列)
- HDU 1159 Common Subsequence(最长公共子序列)
- (源码)VC开发百分百仿360安全卫士界面,可换肤,可缩放
- 字符串之字符串左旋
- java 向上转型之后调用子类的同名变量/方法的问题(多态)
- MFC中创建新消息
- 棋类竞赛网站(不断更新)
- hdu 1159 Common Subsequence 最长公共子序列
- 在MFC中添加用户自定义消息【转载】
- 解决MyEclipse中使用Alt+/没有提示的问题
- 用快排实现寻找数组中的最小k个数
- 线程的创建和退出
- 堆栈的使用
- Hibernate基础之一:Hibernate4.1.6第一个程序
- hdu 1599 find the mincost route
- hdu 1160 FatMouse's Speed