POJ1458————Common Subsequence
来源:互联网 发布:淘宝小额免密支付 编辑:程序博客网 时间:2024/06/16 05:18
Common Subsequence
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 52488 Accepted: 21709
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 <cstdio>#include <iostream>#include <cmath>#include <algorithm>#include <string>#include <cstring>using namespace std;const int MAXN=1010;const int INF=0xfffffff;int dp[MAXN][MAXN];int main(){ ios::sync_with_stdio(false); string a,b; while(cin>>a>>b){ int n=a.length(); int m=b.length(); memset(dp,0,sizeof(dp)); for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ if(a[i]==b[j]){ dp[i+1][j+1]=dp[i][j]+1; }else{ dp[i+1][j+1]=max(dp[i][j+1],dp[i+1][j]); } } } cout<<dp[n][m]<<endl; }}
阅读全文
0 0
- POJ1458——Common Subsequence
- POJ1458————Common Subsequence
- poj1458——Common Subsequence(最长公共子序列)
- 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
- easybcd安装win10和Ubuntu双系统
- ubuntu安装
- Step7:material design的基本介绍以及安装
- Java网络爬虫--正则表达式之详解贪婪、逐步、独吐量词
- 《Unix环境高级编程》第二版
- POJ1458————Common Subsequence
- ubuntu17.04配置opencv3.20(包括contrib)(支持C++,Python3)
- C# 选项、单选、多选、分组、MDI窗体的设计、PictureBox
- 阿里物联网套件-服务端SDK学习实践(基础篇-11发消息到指定的Topic)
- c++算法之回溯 素数环(一)
- 如何配置EditPlus中Java运行环境,运行Java程序
- SQL内置函数
- Xilinx Vivado的使用详细介绍(1):创建工程、编写代码、行为仿真、Testbench
- FutureTask获取线程返回值, 用来获取耗时较长的计算结果