POJ 1458 Common Subsequence

Common Subsequence

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 58537		Accepted: 24443

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, x _ij = 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问题

dp[i][j]表示s1左边i个字符和s2左边j个字符所组成的字符串所组成的最大公共子序列的长度。

状态转移方程为如果s1[i-1]和s2[j-1]相等，那么dp[i][j] = dp[i-1][j-1]+1

否则的话dp[i][j] = max(dp[i-1][j],dp[i][j-1)

可以证明dp[i][j]一定不比这两者小，也不会比这两者都大。

然后就是转移方向。