HDU 1159 Common Subsequence（最长公共子序列（LCS） 动态规划（DP））

原题

Common Subsequence

Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u

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[i+1][j+1]=dp[i][j]+1 (S i+1=T j+1)

dp[i+1][j+1]=max(dp[i][j+1],dp[i+1][j]) (S i+1 != T j+1)

时间复杂度O(nm),dp[n][m]就是LCS长度。

代码

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
using namespace std;
string a,b;
int dp[1001][1001];
int solve(int al,int bl)
{
    for(int i=0;i<al;i++)
    {
        for(int j=0;j<bl;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]);
            }
        }
    }
    return dp[al][bl];
}
int main()
{
    while(cin>>a>>b)
    {
        int al=a.length();
        int bl=b.length();
        printf("%d\n",solve(al,bl));
    }
    return 0;
}

注：文章大部分内容源于《挑战程序设计竞赛》（第二版）