poj 1458 Common Subsequence -- 最长公共子序列
来源:互联网 发布:mac虚拟机哪个好用 编辑:程序博客网 时间:2024/06/05 04:29
Common Subsequence
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 46310 Accepted: 18996
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
最长公共子序列问题,经典的dp问题
#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;int dp[1005][1005];char s1[1005],s2[1005];int main(){int i,j;while(~scanf("%s %s",&s1,&s2)){int l1 = strlen(s1);int l2 = strlen(s2);memset(dp,0,sizeof(dp));for(i=0;i<=l1;i++)dp[i][0]=0;for(j=0;j<=l2;j++)dp[0][j]=0;for(i=1;i<=l1;i++){for(j=1;j<=l2;j++){if(s1[i-1]==s2[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[l1][l2]);}return 0;}
0 0
- poj Common Subsequence 最长公共子序列
- 最长公共子序列(LCS, Longest Common Subsequence), POJ 1458
- POJ 1458 Common Subsequence(求最长公共子序列)
- POJ 1458 Common Subsequence.(最长公共子序列)
- POJ 1458 Common Subsequence (动规,最长公共子序列)
- Common Subsequence - POJ 1458 最长非连续公共子序列
- POJ 1458-Common Subsequence最长公共子序列
- POJ 1458 Common Subsequence (最长公共子序列)
- POJ 1458 Common Subsequence 最长公共子序列
- poj 1458 Common Subsequence dp 最长公共子序列
- POJ 1458 Common Subsequence(最长公共子序列问题)
- POJ 1458 Common Subsequence(最长公共子序列LCS)
- poj 1458 Common Subsequence(最长公共子序列)
- POJ 1458 Common Subsequence 【最长公共子序列】
- POJ 1458Common Subsequence 最长公共子序列问题
- poj 1458 Common Subsequence (LCS(最长公共子序列))
- poj 1458 Common Subsequence 最长公共子序列问题
- POJ 1458-Common Subsequence(dp之最长公共子序列)
- GDOI2016 总结
- Unity3D游戏开发之虚拟现实项目开发流程
- 字符串删除空格问题
- 《金刚经》
- this Virtual Directory does not allow contents to be listed. 网站默认文档没有加入对应的比如index.html
- poj 1458 Common Subsequence -- 最长公共子序列
- 题目1026:又一版 A+B 学习
- Java语言JDBC数据库
- #Pragma 指令
- Spark组件之GraphX学习8--随机图生成和TopK最大入度
- Expandablelistview使用方法
- Centos6.5进入救援模式的方法
- 如何正确获得Android内外SD卡路径
- 多对象的内存管理