HDU1159 && POJ1458：Common Subsequence(LCS)

最新推荐文章于 2016-08-12 15:28:57 发布

原创最新推荐文章于 2016-08-12 15:28:57 发布 · 1.8k 阅读

1 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#LCA #POJ #HDU

DP 专栏收录该内容

117 篇文章

订阅专栏

本文介绍了一个算法，用于找出两个给定字符串之间的最长公共子序列，并提供了实现该算法的C++代码示例。

Problem 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.
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.

Sample Input

abcfbc abfcab
programming contest 
abcd mnp

Sample Output

4
2
0

题意：求出两个串的公共子序列的长度

思路：LCS的入门题，直接模板就可以了

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;

char s1[1000],s2[1000];
int dp[1000][1000];
int len1,len2;

void LCS()
{
    int i,j;
    memset(dp,0,sizeof(dp));
    for(i = 1; i<=len1; i++)
    {
        for(j = 1; j<=len2; j++)
        {
            if(s1[i-1] == s2[j-1])
                dp[i][j] = dp[i-1][j-1]+1;
            else
                dp[i][j] = max(dp[i-1][j],dp[i][j-1]);
        }
    }
}

int main()
{
    while(~scanf("%s%s",s1,s2))
    {
        len1 = strlen(s1);
        len2 = strlen(s2);
        LCS();
        printf("%d\n",dp[len1][len2]);
    }

    return 0;
}