zoukankan      html  css  js  c++  java
  • 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
    #include <iostream>
    #include <string>
    #include <algorithm>
    using namespace std;
    int M[10001][10001];
    int main()
    {
        int n, m, j, k, i;
        string a, b;
        while (cin >> a >> b)
        {
            n = a.length();
            m = b.length();
            for (i = 0; i <= n; i++)
                M[i][0] = 0;
            for (j = 0; j <= m; j++)
                M[0][j] = 0;
            for (i = 1; i <= n; i++)
            {
                for (j = 1; j <= m; j++)
                {
                    if (a[i - 1] == b[j - 1])
                    {
                        M[i][j] = M[i - 1][j - 1] + 1;
                    }
                    else {
                        M[i][j] = max(M[i][j - 1], M[i - 1][j]);
                    }
                }
            }
            cout << M[n][m] << endl;
        }
    }
  • 相关阅读:
    ajax请求
    easyui相关问题
    linux解压命令
    angular2 中文学习资料整理
    在angular2服务中注入服务
    Angular 2模板语法
    登录,注册流程(基于token的身份验证)
    Node Js与JavaScript的区别及nodejs优缺点。
    yarn包管理网站
    浅谈Cookie,Session,WebStorage区别,应用场景
  • 原文地址:https://www.cnblogs.com/andrew3/p/9610982.html
Copyright © 2011-2022 走看看