Common Subsequence dp
来源:互联网 发布:北京行知实践园作文 编辑:程序博客网 时间:2024/06/01 10:47
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, x ij = 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 Output Sample Input Sample Output
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.
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.
abcfbc abfcabprogramming contest abcd mnp
420
题意:给定两个字符串,求其最长公共子串。其中子串不必是连续的,即ac是abc的子串。
用dp[i][j]来表示a串前i个字符与b串前j个字符的公共子串最长长度。
状态转移方程:
如果a[i]==b[j] dp[i][j]=dp[i-1][j-1]+1; 因为a[i]和b[j]是相等的,所以长度就是dp[i-1][j-1]加一就行
如果a[i]!=b[j] dp[i][j]=max(dp[i-1][j],dp[i][j-1]); 因为a[i]和b[j]是不相等的,所以现在的最长就是a的前i-1在b的前j的最长和a的前i在b的前j-1的最长中的较大值。
#include<iostream>#include<cstring>#include<cmath>#include<algorithm>using namespace std;int dp[1000][1000];int main() {string a,b;while(cin>>a>>b) {int La,Lb;La=a.size() ;Lb=b.size() ;int Max=0;memset(dp,0,sizeof(dp));for(int i=0; i<a.size(); i++) {for(int j=0; j<b.size(); j++) {if(a[i]==b[j]) {if(i>0&&j>0)dp[i][j]=dp[i-1][j-1]+1;elsedp[i][j]=1;}if(a[i]!=b[j]) {if(i>0&&j>0)dp[i][j]=max(dp[i-1][j],dp[i][j-1]);else if(i>0)dp[i][j]=dp[i-1][j];else if(j>0)dp[i][j]=dp[i][j-1];}Max=max(Max,dp[i][j]);}}cout<<Max<<endl;}}
阅读全文
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)
- IDEA导入elipse构建的github项目
- 单链表(不含头结点)--尾插,查找
- 进程间通信
- bzoj 1486: [HNOI2009]最小圈
- c++知识点----定义抽象基类(纯虚函数)
- Common Subsequence dp
- 前端面试必问
- thinkphp小细节
- 五子棋的简单实现
- pwnable之unlink
- java多线程——并发测试
- docker高级应用之cpu与内存资源限制(转)
- springMVC的注解@RequestParam与@PathVariable的区别
- Hessian 配置时遇到的浏览器报500错误