Common Subsequence

淅淅沥沥的熙

于 2020-02-18 17:18:16 发布

阅读量150

点赞数

分类专栏：算法文章标签：算法

本文链接：https://blog.csdn.net/qq_38440882/article/details/104378748

版权

算法专栏收录该内容

19 篇文章 0 订阅

订阅专栏

给定两个序列X和Y，目标是找到X和Y的最长公共子序列的长度。输入包含两个由空格分隔的字符串，分别代表这两个序列。输出为最长公共子序列的长度。示例输入和输出分别展示了一组字符串的最长公共子序列长度。

摘要由CSDN通过智能技术生成

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

#include<iostream>
#include<cstdio>
#include<cstring>
//最长公共子序列
using namespace std;

const int MAXN=1001;
char s1[MAXN];
char s2[MAXN];
int dp[MAXN][MAXN];

int main(){
    while(scanf("%s%s",s1+1,s2+1)!=EOF){//从下标1开始输入
        int n=strlen(s1+1);
        int m=strlen(s2+1);
        for(int i=0;i<=n;i++){
            for(int j=0;j<=m;j++){
                if(i==0||j==0){//边界条件初始化
                    dp[i][j]=0;
                    continue;
                }
                //状态转移方程
                if(s1[i]==s2[j]) 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;
    }
}