Common Subsequence

最新推荐文章于 2020-07-27 17:00:57 发布

raptor.

最新推荐文章于 2020-07-27 17:00:57 发布

阅读量1.8k

点赞数

本文链接：https://blog.csdn.net/C18854805113/article/details/73457523

版权

动态规划专栏收录该内容

26 篇文章 0 订阅

订阅专栏

Common Subsequence

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 1415 Accepted Submission(s): 759

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

      
      
       
       题目大意：名字就叫公共子序列了
       
       借一张图来
       
       
       
       F[i][j]=F[i-1][j-1]+1；（a[i]==b[j]）
F[i][j]=max(F[i-1][j],F[i][j-1])(a[i]!=b[j]);
       
       #include <iostream>
#include<string.h>
#include<string>
using namespace std;
int max(int a,int b)
{
if(a>b)return a;
else return b;
}
int main()
{
    string a,b;
    int len1,len2,i,j,n;
    int ans[1001][1001];
    while(cin>>a>>b)
    {
        memset(ans,0,sizeof(ans));
        len1=a.size();
        len2=b.size();
        for(i=1;i<=len1;i++)
            for(j=1;j<=len2;j++)
                {
                    if(a[i-1]==b[j-1])
                        ans[i][j]=ans[i-1][j-1]+1;
                    else 
                        ans[i][j]=max(ans[i-1][j],ans[i][j-1]);
                }
        cout<<ans[len1][len2]<<endl;
    }
    return 0;
}