POJ1458 Common Subsequence
来源:互联网 发布:淘宝网男装休闲中山 编辑:程序博客网 时间:2024/06/05 16:10
题目:
点击这里查看原题
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
解答:
//POJ1458 //最长公共子序列#include<iostream>#include<cstring>using namespace std;char sz1[1000],sz2[1000];int maxLen[1000][1000];int main(){ while(cin>>sz1>>sz2){ int length1=strlen(sz1); int length2=strlen(sz2); int nTmp; for(int i=0;i<=length1;i++)maxLen[i][0]=0; for(int j=0;j<=length2;j++)maxLen[0][j]=0; for(int i=1;i<=length1;i++){ for(int j=1;j<=length2;j++){ if(sz1[i-1]==sz2[j-1])maxLen[i][j]=maxLen[i-1][j-1]+1; else maxLen[i][j]=max(maxLen[i][j-1],maxLen[i-1][j]); } } cout<<maxLen[length1][length2]<<endl; } return 0;}
- poj1458 dp Common Subsequence
- poj1458 - Common Subsequence
- poj1458(Common Subsequence)
- POJ1458 Common Subsequence
- POJ1458--Common Subsequence
- POJ1458 Common Subsequence
- Common Subsequence(poj1458)
- POJ1458 Common Subsequence
- POJ1458 Common Subsequence
- POJ1458 Common Subsequence
- Common Subsequence(poj1458)
- POJ1458 Common Subsequence DP
- POJ1458 Common Subsequence
- poj1458 Common Subsequence【LCS】
- POJ1458 Common Subsequence
- POJ1458 Common Subsequence
- POJ1458 Common Subsequence
- poj1458 Common Subsequence
- Python学习day06 装饰器
- 360安全卫士hookport.sys简单逆向
- hdoj 6066(2017 Multi-University Training Contest
- 基于python的Word2Vec从分词到训练数据集详解
- TypeError: 'module' object is not callable
- POJ1458 Common Subsequence
- hdu1257 最小拦截系统
- tower图片
- 分析了一下360安全卫士的hook(zt)
- 河南省多校连萌(七)H
- Java StringBuffer
- CMD一键获取 所有连接过的WIFI密码
- Java入门第三式
- Git 使用vi或vim命令打开、关闭、保存文件