poj 1458 Common Subsequence LCS

最新推荐文章于 2020-07-04 14:56:09 发布

阑珊灬回忆

最新推荐文章于 2020-07-04 14:56:09 发布

阅读量282

点赞数

分类专栏： ACM 文章标签： DP

本文链接：https://blog.csdn.net/haoliang94/article/details/53160440

版权

ACM 专栏收录该内容

51 篇文章 0 订阅

订阅专栏

Common Subsequence

Time Limit: 1000MS

Memory Limit: 10000KB

64bit IO Format: %lld & %llu

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

#include <iostream>
#include <cstdio>
#include <cstring>


/************************************************

designer:hl
time:2016/11/14
Exe.Time:32 ms
Exe.Memory:892 KB

题目链接：http://poj.org/problem?id=1458

题意：裸LCS

题解：主要的坑是好久没打ACM了。RE了两次。看了别人的代码才意识到dp数组要放到外面
************************************************/

using namespace std;
int dp[222][222];

int main() {
    char m[222], n[222];
    int i, j, k, l;
    //cout <<str;
    while (~scanf("%s%s", m, n)) {
        int mlen = strlen(m);
        int nlen = strlen(n);
        //cout << m << ' ' << n;
        memset(dp, 0, sizeof(dp));
        for (i = 0; i < mlen; i++) {
            for (j = 0; j < nlen; j++) {
                int tempmax = dp[i][j + 1] > dp[i + 1][j] ? dp[i][j + 1] : dp[i + 1][j];
                if (m[i] == n[j]) {
                    dp[i + 1][j + 1] = max(dp[i][j] + 1, tempmax);
                } else {
                    dp[i + 1][j + 1] = tempmax;
                }
            }
        }
        printf("%d\n", dp[mlen][nlen]);
    }
    return 0;
}