[POJ]1458 Common Subsequence

最新推荐文章于 2024-10-01 18:52:56 发布

Miner_Sty

最新推荐文章于 2024-10-01 18:52:56 发布

阅读量386

点赞数

分类专栏：算法之路文章标签： poj 动态规划最长公共子序列

本文链接：https://blog.csdn.net/Miner_Sty/article/details/50107979

版权

算法之路专栏收录该内容

10 篇文章 0 订阅

订阅专栏

[POJ]1458 Common Subsequence

问题

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.

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

分析

题目要求查找两个字符串的最大公共子序列，*注意是公共子序列不是子串，方法与最大公共子串类似，采用动态规划的思想，只需稍有改动即可。
假设字符串分别为x与y，动态规划表为dp，从左上角一直计算到右下角，最终dp[m][n]即为最大公共子序列的长度（m为x的长度，n为y的长度）。公式为：

以题中数据为例，可画出其效果图。

源代码

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;

int main() {
    string str1, str2;
    while (cin >> str1 >> str2) {
        int m = str1.length(), n = str2.length();
        vector<vector<int> > dp(n+1, vector<int>(m+1, 0));
        for (int i = 1; i <= n; ++i) {
            for (int j = 1; j <= m; ++j) {
                if (str1[j-1] == str2[i-1])
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                else
                    dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
            }
        }
        cout << dp[n][m] << endl;
    }
    return 0;
}