POJ1458 Common Subsequence
来源:互联网 发布:mac air pro 编辑:程序博客网 时间:2024/05/16 13:56
Common Subsequence
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 30903 Accepted: 12045
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
这是一个LCS的问题,至于LCS是什么,你百度吧。
#include<iostream>#include<cstdio>#include<cstring>#include<string>using namespace std;int main(){ string a,b; int f[1000][1000]; while(cin>>a>>b) { int m=a.length(); int n=b.length(); for(int i=0;i<=m;i++)f[0][i]=0; for(int j=0;j<=n;j++)f[j][0]=0; for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) { if(a[j-1]==b[i-1])f[i][j]=f[i-1][j-1]+1; else f[i][j]=max(f[i][j-1],f[i-1][j]); } } cout<<f[n][m]<<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
- 数据结构---->数组
- 由前序和中序确定一棵二叉树
- 简单解析xml属性值
- 黑马程序员------装饰设计模式
- Java上路06-面向对象
- POJ1458 Common Subsequence
- 基础题目-素数分解(原创分享)
- 例题5.4.3
- C++ 判断点是否在一个面内
- 深入Flex4——了解Element和Child的异同
- 判断是否为完全二叉树
- 用XML-RPC协议读写WordPress上的文章
- ALV输出页抬头标题
- 排序算法练习