HDU 1159 Common Subsequence(dp最大公共子串)
来源:互联网 发布:虚拟机ubuntu怎么联网 编辑:程序博客网 时间:2024/06/03 23:41
Common Subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22368 Accepted Submission(s): 9801
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
#include <stdio.h>#include <string.h>#define max(a,b) a>b?a:b;char a[1000],b[1000];int dp[1000][1000];int main(){int i,j,len1,len2;while(~scanf("%s%s",a,b)){//memset(dp,0,sizeof(dp));for(i=0;i<len1;i++)dp[i][0]=0;len1=strlen(a);len2=strlen(b);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;elsedp[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(dp最大公共子串)
- hdu 1159 Common Subsequence 最大公共子串
- HDU-1159 Common Subsequence (线性dp 最长公共子串)
- HDU 1159 Common Subsequence--DP--(最长公共子序列)
- HDU 1159 Common Subsequence(DP最长公共子序列)
- HDU 1159 Common Subsequence(最长公共子序列)dp
- 【HDU】1159 Common Subsequence(DP、最长公共子序列)
- HDU 1159 Common Subsequence 最大公共子序列
- HDU 1159 Common Subsequence 最大公共子序列
- hdu 1159 Common Subsequence(DP最长公共子序列)
- 最长公共子序列DP Common Subsequence HDU 1159
- 最长公共子序列(dp) & hdu 1159 Common Subsequence
- hdu 1159 Common Subsequence(最长公共子序列 DP)
- HDU 1159 Common Subsequence 公共子序列 简单DP
- hdu 1159(Common Subsequence)简单dp,求出最大的公共的字符数
- HDU 1159 Common Subsequence (求两个串的最长公共子序列 dp)
- HDU 1159 Common Subsequence(最长公共子序列(LCS) 动态规划(DP))
- POJ 1458 && HDU 1159 Common Subsequence (最長公共子序列)dp
- js中json数据和字符串之间的相互转换
- 关于LinkedHashMap和HashMap的比较使用
- 2014.7.14
- hdu 1020 Encoding
- Android 自定义UI圆角按钮
- HDU 1159 Common Subsequence(dp最大公共子串)
- oracle使用exp导出dmp文件后表对象缺失问题的原因及解决办法
- NoSQL & MongoDB
- css练习: 利用锚点做选取相册效果
- java语言,通过反射获得类中的字段,及对应值。
- UVa11770 - Lighting Away(排序+DFS)
- VLC命令行参数详解
- hdu 1022 Train Problem I_栈的应用经典例题
- Spring工作原理及其作用 .