POJ 1458 Common Subsequence
来源:互联网 发布:最小的c语言软件 编辑:程序博客网 时间:2024/06/06 16:42
题目
总时间限制: 1000ms 内存限制: 65536kB
描述
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.
输入
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.
输出
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.
样例输入
abcfbc abfcab
programming contest
abcd mnp
样例输出
4
2
0
来源
Southeastern Europe 2003
思路
代码
while True: try: s1, s2 = input().strip().split() l1 = len(s1) l2 = len(s2) dp = [[0 for i in range(l2 + 1)] for j in range(l1 + 1)] for i in range(l1): for j in range(l2): if s1[i] == s2[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]) print(dp[l1][l2]) except: break
- Common Subsequence--poj--1458
- poj 1458 Common Subsequence
- poj 1458 Common Subsequence
- Poj 1458 Common Subsequence
- POJ 1458 Common Subsequence
- poj 1458 Common Subsequence
- poj 1458 Common Subsequence
- POJ 1458 Common Subsequence
- poj 1458 Common Subsequence
- POJ-1458-Common Subsequence
- POJ 1458 Common Subsequence
- poj 1458 Common Subsequence
- POJ 1458 Common Subsequence
- poj 1458 Common Subsequence
- POJ 1458 Common Subsequence
- POJ 1458 Common Subsequence
- POJ 1458 Common Subsequence
- poj 1458 Common Subsequence
- 微信支付 安卓
- Oracle学习5:SQL单行函数详解
- Tensflow学习笔记(一)——TF生成并查看数据
- 基于bbr拥塞控制的云盘提速实践
- 文兄的算法题——算术表达式递归构造二叉树
- POJ 1458 Common Subsequence
- 使用Spring Could 实现负载均衡
- Linux Shell脚本中获取本机ip地址方法
- Androidstudio快速打开一个新的project,节省时间,省去加载时间
- 机器学习之奇异值分解SVD及应用于协同过滤推荐和LSA潜在语义分析
- ROS学习第七弹--写简单的发布订阅(C++)
- 简单搜索
- Gradle DSL method not found: 'implementation()'错误解决
- SOAPUI读取Excel数据执行循环测试(loop test)