Common Subsequence DP最长公共子序列
2017-08-15 21:21
267 查看
Common Subsequence
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
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 abfcab programming contest abcd mnp
Sample Output
4 2 0 题解出处:http://blog.csdn.net/a_eagle/article/details/7213236
题目大意:给出两个字符串,求两个字符串的最长公共字串。
思路:慢慢重心开始有贪心转向动态规划了,这题就是简单的动态规划题。以题目的第一组测试数据为例。abcfbc abfcab。
辅助空间变化示意图
可以看出:
F[i][j]=F[i-1][j-1]+1;(a[i]==b[j])
F[i][j]=max(F[i-1][j],F[i][j-1])(a[i]!=b[j]);
n由于F(i,j)只和F(i-1,j-1), F(i-1,j)和F(i,j-1)有关, 而在计算F(i,j)时, 只要选择一个合适的顺序, 就可以保证这三项都已经计算出来了, 这样就可以计算出F(i,j). 这样一直推到f(len(a),len(b))就得到所要求的解了.
#include<stdio.h> #include<string.h> int f[1005][1005]; char s1[1005],s2[1005]; int max(int x,int y) { return x>y?x:y; } int main() { int n,i,j; while(~scanf("%s %s",s1,s2)){ memset(f,0,sizeof(f)); for(i=1;i<=strlen(s1);i++){ for(j=1;j<=strlen(s2);j++){ if(s1[i-1]==s2[j-1]){ f[i][j]=f[i-1][j-1]+1; } else f[i][j]=max(f[i-1][j],f[i][j-1]); } } printf("%d\n",f[strlen(s1)][strlen(s2)]); } return 0; }
相关文章推荐
- (Relax DP1.6)UVA 10405 Longest Common Subsequence(使用DP来求解最长公共子序列LCS)
- 最长公共子序列DP Common Subsequence HDU 1159
- hdu 1159 Common Subsequence(最长公共子序列,DP)
- HDU 1159 Common Subsequence(最长公共子序列)dp
- poj1458 Common Subsequence (dp,最长公共子序列)
- 【HDU】1159 Common Subsequence(DP、最长公共子序列)
- hdu 1159 Common Subsequence(最长公共子序列 DP)
- HDU 1159 Common Subsequence (求两个串的最长公共子序列 dp)
- HDU 1159 Common Subsequence【dp+最长公共子序列】
- Common Subsequence经典DP,最长公共子序列
- PKU 1458 Common Subsequence(最长公共子序列,dp,简单)
- HDU 1159 Common Subsequence --- DP入门之最长公共子序列
- POJ--1458:Common Subsequence (DP求最长公共子序列)
- (hdu step 3.2.2)Common Subsequence(简单dp:求最长公共子序列的长度)
- HDUOJ 1159 - Common Subsequence(DP:最长公共子序列LCS)
- DP算法之—Longest Common Subsequence - 最长公共子序列
- DP动态规划——hdu 1008 Common Subsequence(最长公共子序列)
- poj 1458 Common Subsequence dp 最长公共子序列
- DP(最长公共子序列)--Common Subsequence
- hdu1159 Common Subsequence 最长公共子序列 经典DP