poj-1458 Common Subsequence
来源:互联网 发布:程序员谈恋爱被动吗 编辑:程序博客网 时间:2024/04/29 00:24
Common Subsequence
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 43214 Accepted: 17529
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.
Input
The program input is from the std input. Each data set in the input contains two strings representing the given sequences. The sequences are separated by any number of white spaces. The input data are correct.
Output
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># include<algorithm>using namespace std; int dp[1010][1010];char a[1010],b[1010];int main(){while(scanf("%s%s",a,b) != EOF){memset(dp, 0, sizeof(dp));int len1 = strlen(a);int len2 = strlen(b);int i, j;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]);}}}printf("%d\n",dp[len1][len2]);}return 0;}
0 0
- Common Subsequence--poj--1458
- poj 1458 Common Subsequence
- poj 1458 Common Subsequence
- Poj 1458 Common Subsequence
- POJ 1458 Common Subsequence
- poj 1458 Common Subsequence
- poj 1458 Common Subsequence
- POJ 1458 Common Subsequence
- poj 1458 Common Subsequence
- POJ-1458-Common Subsequence
- POJ 1458 Common Subsequence
- poj 1458 Common Subsequence
- POJ 1458 Common Subsequence
- poj 1458 Common Subsequence
- POJ 1458 Common Subsequence
- POJ 1458 Common Subsequence
- POJ 1458 Common Subsequence
- poj 1458 Common Subsequence
- Android注解框架AndroidAnnotations学习笔记
- android 自定义ProgressBar
- 既可以滑动也可以点击切换(ViewPager跟Fragment)
- dfs.datanode.max.xcievers&dfs.datanode.max.transfer.threads介绍
- 1.精度计算——大数阶乘
- poj-1458 Common Subsequence
- 【OSS】OSS的Multipart上传
- 彻底理解C#中值类型和引用类型的区别
- android MVP
- Hadoop2.x eclipse下编程环境配置
- 使用Android design support library在Eclipse和Android Studio
- 响应式开发(一)-----响应式网页设计学习导航
- treap模板
- 结构体偏移量