hdoj 1159 Common Subsequence 【最大连续子序列】
来源:互联网 发布:阿里云如何查看发票 编辑:程序博客网 时间:2024/06/06 19:04
Common Subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 26373 Accepted Submission(s): 11713
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
dp模板:
#include<stdio.h>#include<string.h>#define MAX 1000+10char str1[MAX],str2[MAX];int dp[MAX][MAX];int max(int x,int y){return x>y?x:y;}int main(){int t,i,j;int l1,l2;while(scanf("%s%s",str1,str2)!=EOF){l1=strlen(str1);l2=strlen(str2);for(i=0;i<=l1;i++)dp[i][0]=0;for(i=0;i<=l2;i++)dp[0][i]=0;for(i=1;i<=l1;i++){for(j=1;j<=l2;j++){if(str1[i-1]==str2[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[l1][l2]);}return 0;}
0 0
- hdoj 1159 Common Subsequence 【最大连续子序列】
- hdoj 1159 Common Subsequence LCS最大公共子序列问题
- hdu 1159Common Subsequence(dp 最大不连续的子序列)
- HDOJ 1159 Common Subsequence(最长公共子序列)
- HDU 1159 Common Subsequence 最大公共子序列
- HDU 1159 Common Subsequence 最大公共子序列
- Common Subsequence最大长度子序列
- (不连续)最大公共子序列POJ 1458Common Subsequence
- hdoj 1231-最大连续子序列
- hdoj 1231(最大连续子序列)
- HDOJ 1231 最大连续子序列
- HDOJ 最大连续子序列 1231
- hdoj 1231 最大连续子序列 【DP】
- hdoj--1231--最大连续子序列
- hdoj 1231最大连续子序列【dp】
- hdoj 1231 最大连续子序列
- HDOJ-----1231最大连续子序列
- HDOJ -- 1231最大连续子序列
- 传智播客 Html基础知识学习笔记2
- Android.mk
- 图像频域滤波处理
- HUD 5194--DZY Loves Balls【规律】
- Android 手机返回键 退出应用
- hdoj 1159 Common Subsequence 【最大连续子序列】
- QT学习笔记
- DFS Permutations
- SDUT 2139 图结构练习——BFS——从起始点到目标点的最短步数(BFS + vector)
- hdu D-City 反向并查集
- sdut-2156(模拟,bfs)
- 传智播客 Html基础知识学习笔记
- OpenCV图像变换(一)卷积
- 从无到有,质的变化