DP-Common Subsequence
来源:互联网 发布:数据库应用系统饭店 编辑:程序博客网 时间:2024/06/05 22:51
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
code:
#include <iostream>#include<algorithm>#include<stdio.h>#include<queue>#include<math.h>#include<string.h>using namespace std;const int MAX=500;int main(){ // freopen("input.txt","r",stdin); string s1,s2; int a[MAX][MAX]; while(cin>>s1>>s2){ int m=s1.length(); int n=s2.length(); memset(a,0,sizeof(a)); for(int i=1;i<=m;i++){ for(int j=1;j<=n;j++){ if(s1[i-1]==s2[j-1]) a[i][j]=a[i-1][j-1]+1; else if(a[i-1][j]>a[i][j-1]) a[i][j]=a[i-1][j]; else a[i][j]=a[i][j-1]; } } cout<<a[m][n]<<endl; } return 0;}
0 0
- poj1458 dp Common Subsequence
- Common Subsequence (dp)
- Common Subsequence HDU dp
- Common Subsequence(DP)
- hdu1159 Common Subsequence DP
- POJ1458 Common Subsequence DP
- [DP]Longest Common Subsequence
- HDOJ1159 Common Subsequence(dp)
- hdu1159 Common Subsequence--DP
- DP-Common Subsequence
- Common Subsequence (dp)
- Common Subsequence [dp]
- Common Subsequence (dp)
- Common Subsequence dp
- zoj 1733 Common Subsequence dp
- ZOJ 1733 Common Subsequence【DP】
- hdu 1159 Common Subsequence #DP
- hdu 1159 Common Subsequence (dp)
- Android中ContentProvider的简单使用
- New Document
- 前端速学成财:第四课-粗糙的玩一玩css的"编译"
- 脉搏测量 心电波形 心率
- mysql模糊查询在jdbc中查不到内容,?两侧没有加空格
- DP-Common Subsequence
- HDU 5780 (欧拉函数)
- Surrounded Regions
- swift的数据类型、运算符和元组的简单使用
- HDU 4544 湫湫系列故事——消灭兔子 (贪心+优先队列)
- CloudVisor译稿
- 如何安装Hadoop 2.6.0完全分布式?
- HDU.5120 Intersection
- Linux的简单介绍