poj 1458 LCS(最长公共子序列)
来源:互联网 发布:java实现支付宝转账 编辑:程序博客网 时间:2024/06/15 14:57
Common Subsequence
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 53343 Accepted: 22124
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 abfcab
programming contest
abcd mnp
Sample Output
4
2
0
Source
Southeastern Europe 2003
dp[i][j]表示 以a的i字符结尾的字符串与以b的j字符结尾的字符串最长的子串长度
如果a[i]==b[j] dp[i][j]=dp[i-1][j-1]+1;
如果a[i]!=b[j] 说明最长子串绝对不是以 a[i]和b[j]结尾的
所以要推到a[i] b[j-1] 和a[i-1]b[j]
dp[i][j]=max(dp[i][j-1],dp[i-1][j])
#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <algorithm>#define maxn 1010using namespace std;char a[maxn];char b[maxn];int dp[maxn][maxn];int main(){ while(scanf("%s%s",a,b)!=EOF) { memset(dp,0,sizeof(dp)); int l1=strlen(a); int l2=strlen(b); for(int i=l1;i>0;i--) { a[i]=a[i-1]; } for(int j=l2;j>0;j--)b[j]=b[j-1]; for(int i=1;i<=l1;i++) { for(int j=1;j<=l2;j++) { if(a[i]==b[j]) { 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[l1][l2]); } return 0;}
- poj 1458 LCS(最长公共子序列)
- poj 1458&poj 1159 最长公共子序列LCS
- poj 1458最长公共子序列(LCS)
- 最长公共子序列(LCS, Longest Common Subsequence), POJ 1458
- poj 1458 LCS(dp)全部最长公共子序列
- POJ 1458 Common Subsequence(最长公共子序列LCS)
- poj 1458 Common Subsequence (LCS(最长公共子序列))
- 最长公共子序列 LCS(模板) poj 1458
- DP-POJ 1458 (LCS 最长公共子序列)
- poj-1458-Common Subsequence-lcs-最长公共子序列-java
- POJ 1458 Common Subsequence 最长公共子序列(LCS)
- LCS:最长公共子序列
- LCS---最长公共子序列
- 最长公共子序列 LCS
- LCS -- 最长公共子序列
- LCS最长公共子序列
- 最长公共子序列LCS
- LCS-最长公共子序列
- rsync同步文件
- 【基础算法强化】(1)分治算法与动态规划
- Python练习题1
- Jvm原理和优化
- static的详解 ----转载
- poj 1458 LCS(最长公共子序列)
- Google VR Demo光标系统分析
- 国务院正式发布《新一代人工智能发展规划》
- fastDFS+nginx
- java实现插入排序
- C#高级编程(第7版)pdf
- javaweb部署服务器 详细版
- codeforces 701 c 尺取法
- 从诗人到程序员