PKUOJ1458 Common Subsequence
来源:互联网 发布:web service 数据库 编辑:程序博客网 时间:2024/06/05 03:13
Common Subsequence
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20787 Accepted: 7902
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
【思路】经典的DP问题,求最长公共子串的长度
- PKUOJ1458 Common Subsequence
- Common Subsequence
- Common Subsequence
- Common Subsequence
- Common Subsequence
- Common Subsequence
- Common Subsequence
- Common Subsequence
- Common Subsequence
- Common Subsequence
- Common Subsequence
- Common Subsequence
- Common Subsequence
- Common Subsequence
- Common Subsequence
- Common Subsequence
- Common Subsequence
- Common Subsequence
- 从栅格数据集返回数组、指针等
- HDU 1466 求直线交点 动态规划
- PKUOJ1593 World Cup Noise
- .NET网站发布经验总结——允许更新此预编译站点
- 软件实施工程师??
- PKUOJ1458 Common Subsequence
- Android中标签TextView的使用
- 国内IT 从业者最担心的是什么
- 孙鑫VC++视频教程14课源码
- Google的十大核心技术
- jsp页面元素
- Java Memcache基本应用
- 你好 cdsn
- 循环卷积