zoukankan      html  css  js  c++  java
  • POJ 1458 Common Subsequence (最长公共子序列)

    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

    典型的动态规划问题,求最长公共子序列(LCS). 这篇文章最长公共子序列(LCS)已经作出了相关解释。

    下面直接给出代码:

     1 #include <iostream>
     2 #include <string.h>
     3 using namespace std;
     4 //LCS问题
     5 int main()
     6 {
     7     string s;
     8     string t;
     9     while(cin>>s>>t)
    10     {
    11         const char* a = s.c_str();
    12         const char* b = t.c_str();
    13         int m = strlen(a) + 1;
    14         int n = strlen(b) + 1;
    15         int** c = new int*[m];
    16         for(int i = 0; i < m; i++)
    17             c[i] = new int[n];
    18 
    19         //m行n列
    20         for(int i = 0; i < m; i++)
    21             c[i][0] = 0;
    22         for(int i = 0; i < n; i++)
    23             c[0][i] = 0;
    24 
    25         for(int i = 1; i < m; i++)
    26             for(int j = 1; j < n; j++)
    27             {
    28                 if(a[i-1] == b[j-1])
    29                     c[i][j] = c[i-1][j-1] + 1;
    30                 else if(c[i][j-1] >= c[i-1][j])
    31                     c[i][j] = c[i][j-1];
    32                 else
    33                     c[i][j] = c[i-1][j];
    34             }
    35 
    36         cout<<c[m-1][n-1]<<endl;
    37         for(int i = 0; i < m; i++)
    38             delete c[i];
    39         delete c;
    40         
    41     }
    42     return 0;
    43 }
  • 相关阅读:
    小网络的激活函数
    Dual Path Networks
    RT600之Mailbox
    RT600之OTFAD
    RSA算法详解
    RT600之SB
    RT600之master key
    RT600之PUF
    RT600 Boot详解
    RT如何生成image
  • 原文地址:https://www.cnblogs.com/null00/p/2560284.html
Copyright © 2011-2022 走看看