HDU1159-Common Subsequence(dp)
来源:互联网 发布:埃尔金贝勒数据 编辑:程序博客网 时间:2024/06/06 13:04
Common Subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 38486 Accepted Submission(s): 17658
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[i][j]=max(dp[i-1][j],dp[i][j-1]),即每次保存两串中公共子串最长的那部分,如果出现相同就+1;
#include <iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>#define inf 0x3f3f3f3f#define mem(a,b) memset(a,b,sizeof(a))using namespace std;int dp[1005][1005];char a[1005];char b[1005];int main(){ while(~scanf("%s %s",a,b)) { int la=strlen(a); int lb=strlen(b); mem(dp,0); for(int i=1; i<=la; i++) { for(int j=1; j<=lb; j++) { if(a[i-1]==b[j-1]) dp[i][j]=dp[i-1][j-1]+1; else dp[i][j]=max(dp[i][j-1],dp[i-1][j]); } } printf("%d\n",dp[la][lb]); }}
阅读全文
0 0
- HDU1159-Common Subsequence(dp)
- hdu1159 Common Subsequence DP
- hdu1159 Common Subsequence--DP
- 【HDU1159】Common Subsequence(LCS/DP)
- hdu1159 Common Subsequence(LCS)
- HDU1159 Common Subsequence (LCS)
- HDU1159 : Common Subsequence(LCS)
- 【hdu1159】common subsequence —— 二维dp
- Common Subsequence(hdu1159(LCS))
- HDU1159 Common Subsequence (LCS)
- HDU1159--Common Subsequence
- hdu1159-Common Subsequence
- hdu1159 Common Subsequence
- HDU1159 Common Subsequence
- HDU1159:Common Subsequence
- HDU1159 Common Subsequence
- HDU1159,Common Subsequence,toCharArray()
- HDU1159:Common Subsequence(LCS)
- 【R语言爬虫】网贷天眼平台表格数据爬虫1
- js 弹出对话框3种方式 .
- openjudge F:Delta Quadrant(坑)
- 2017国际大学生程序设计大赛全国邀请赛(陕西)小结
- TensorFlow损失函数专题
- HDU1159-Common Subsequence(dp)
- 局部自相似描述子论文《Matching Local Self-Similarities across Images and Videos》读后感
- 06-图2 Saving James Bond
- Java思维导图(5)--Java API
- Entity Framework Core 创建表一对一,表之间外键【约束】
- ATM交易状态特征分析与异常检测(深圳杯B题)
- hdoj1021 Fibonacci Again
- java api 查询hbase
- Codeforces161D【树形DP】