HDU 1159 & POJ 1458 Common Subsequence （LCS）

最新推荐文章于 2018-08-18 15:44:51 发布

sxk_sxy

最新推荐文章于 2018-08-18 15:44:51 发布

阅读量749

点赞数

分类专栏： DP

本文链接：https://blog.csdn.net/u013446688/article/details/38364973

版权

DP 专栏收录该内容

26 篇文章 0 订阅

订阅专栏

Common Subsequence

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

Submit Status

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 _{i_j} = 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

题意：给你两个字符串s1,s2，求两个字符串的最长公共子序列的长度。

心得：这是个技术活，凭空想当然想不出来，只好从书上借鉴了一些。。。

分析：纯裸的最长公共子序列，不解释。。。总体思想是DP，直接搞，开个二维数组dp,从两个字符串的开头往后扫，dp[i][j]代表s1扫s1[i]位置、s2扫到s2[j]位置时的最长公共子序列的长度，dp[i][j] = max( dp[i-1][j] , dp[i][j-1] ) ,且当s1[i-1] == s2[j] 时，dp[i][j] = max( dp[i][j] , dp[i-1][j-1] +1) .

AC代码：

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include <cstdlib>
#include <ctime>
#define INF 0x7fffffff
using namespace std;
const int maxn = 1000 + 10;
string a,b;
int dp[maxn][maxn];

int LCS(int n1, int n2, string c, string d)
{
    for(int i = 1; i <= n1; i++)
        for(int j = 1; j <= n2; j++)
        {
            dp[i][j] = max(dp[i-1][j], dp[i][j-1]);
            if(c[i-1] == d[j-1] && dp[i-1][j-1] + 1 > dp[i][j])
                dp[i][j] = dp[i-1][j-1] + 1;
        }
    return dp[n1][n2];
}

int main()
{
    while(cin>>a>>b)
    {
        memset(dp,0,sizeof(dp));            //初始化dp数组
        cout<<LCS(a.size(),b.size(),a,b)<<endl;    
    }
    return 0;
}