POJ 1458 Common Subsequence(最长公共子序列模版题)
来源:互联网 发布:淘宝海运到美国 编辑:程序博客网 时间:2024/06/14 19:07
Common Subsequence
Time Limit: 1000MS
Memory Limit: 10000KTotal Submissions: 53101
Accepted: 22026
Memory Limit: 10000KTotal Submissions: 53101
Accepted: 22026
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
Source
Southeastern Europe 2003
题目大意:给两个字符串,求最长公共子序列
AC代码
#include<iostream>#include<cstdio>#include<cstring>using namespace std;char s[5005],e[5004];int dp[2][5005];int main(){int n;while(scanf("%s%s",s,e)!=EOF){int n=strlen(s);int m=strlen(e);memset(dp,0,sizeof(dp));int ans=0;for(int i=1;i<=n;i++){for(int j=1;j<=m;j++){if(s[i-1]==e[j-1]){dp[i%2][j]=dp[(i-1)%2][j-1]+1;}else{dp[i%2][j]=max(dp[(i-1)%2][j],dp[i%2][j-1]);}ans=max(dp[i%2][j],ans);}}printf("%d\n",ans);}return 0;}
阅读全文
0 0
- POJ 1458 Common Subsequence(最长公共子序列模版题)
- POJ 1458 Common Subsequence(最长公共子序列问题)
- POJ 1458 Common Subsequence(最长公共子序列)
- POJ 1458 Common Subsequence 最长公共子序列(LCS)
- 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(最长公共子序列LCS)
- poj 1458 Common Subsequence(最长公共子序列)
- POJ 1458 Common Subsequence 【最长公共子序列】
- POJ 1458Common Subsequence 最长公共子序列问题
- AC自动机
- 统计学习方法笔记, 第四章,朴素贝叶斯python实现
- mybatis-入门案例
- Linux---stat函数以及自己实现stat
- MyBatis的坑(Parameter 'XXX' not found)
- POJ 1458 Common Subsequence(最长公共子序列模版题)
- AtOffer笔记
- 能否向函数传递一个数组?
- 在idea里,点击浏览器图标没反应,解决方案
- char 字符型
- Linux 常用基本命令 压缩 解压缩 tar
- JS和JSP的区别
- windows下向GitHub上传代码
- equals ==(不求甚解 )补充 十七