您的位置：首页 > 产品设计 > UI/UE

HDOJ_ACM_Common Subsequence

2012-11-14 14:45 337 查看

[align=left]Problem Description[/align]
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 a text file. Each data set in the file 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.

[align=left]Sample Input[/align]

abcfbc abfcab
programming contest
abcd mnp

[align=left]Sample Output[/align]

4
2
0

[align=left]Code[/align]

View Code

[align=left]Key points[/align]
[align=left]If you realize the state transition equation, you will solve it.[/align]
[align=left]Take abcfbc abfcb for example, the result is as follow, and the state transition equation is[/align]
[align=left]if s1[i]=s[j] f[i][j]=f[i-1][j-1] + 1[/align]
[align=left]if s1[i]!=[j] f[i][j]=max(f[i-1][j], f[i][j-1])[/align]

		a	b	c	f	b	c
	0	0	0	0	0	0	0
a	0	1	1	1	1	1	1
b	0	1	2	2	2	2	2
f	0	1	2	2	3	3	3
c	0	1	2	3	3	3	4
b	0	1	2	3	3	3	4

内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理

标签：

相关文章推荐

新的分享

章节导航