poj 1458Common Subsequence(最长公公子序列)
来源:互联网 发布:js设置style属性值 编辑:程序博客网 时间:2024/04/26 06:34
水题,水过……
Common Subsequence
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 25577 Accepted: 9891
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
#include<iostream>#include<string>#include<cstring>using namespace std;int main(){ string str1, str2; int i, j, len1, len2; int c[300][300]; while(cin>>str1>>str2) { memset(c, 0, sizeof(c)); len1=str1.length(); len2=str2.length(); for( i=1; i<=len1; i++) for(j=1; j<=len2; j++) { if( str1[i-1]==str2[j-1] ) c[i][j]=c[i-1][j-1]+1; else { c[i][j]=c[i-1][j]>c[i][j-1]?c[i-1][j]:c[i][j-1]; } } cout<<c[len1][len2]<<endl; }}
- poj 1458Common Subsequence(最长公公子序列)
- POJ 1458:Common Subsequence【最长子序列】
- 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(最长公共子序列))
- index full scan与index fase full scanu区别
- 内存池的实现(1)
- PF_RING安装指南
- ubuntu 10.04 下安装nfs服务器
- Oracle 无响应故障
- poj 1458Common Subsequence(最长公公子序列)
- iPhone 图标设置
- PF_RING开发指南
- 名言警句收录
- 我的调试器
- webservice开发(附源码)
- Android focus处理
- C# 简单任务池
- NASA使用全新测量技术 称地球体积固定不再长大