zoukankan      html  css  js  c++  java
  • POJ1458(KB12-L LCS)

    Common Subsequence

    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 51319   Accepted: 21146

    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

    Source

     
     1 //2017-04-04
     2 #include <iostream>
     3 #include <cstdio>
     4 #include <cstring>
     5 
     6 using namespace std;
     7 
     8 const int N = 10000;
     9 int dp[N][N];//LCS, dp[i][j]表示a[0~i]和b[0~j]的公共子序列长度
    10 
    11 int main()
    12 {
    13     string a, b;
    14     int n, m;
    15     while(cin>>a>>b)
    16     {
    17         n = a.length();
    18         m = b.length();
    19         for(int i = 0; i < n; i++){
    20             for(int j = 0; j < m; j++){
    21                 if(a[i] == b[j])dp[i+1][j+1] = dp[i][j]+1;
    22                 else dp[i+1][j+1] = max(dp[i+1][j], dp[i][j+1]);
    23             }
    24         }
    25         cout<<dp[n][m]<<endl;
    26     }
    27 
    28     return 0;
    29 }
  • 相关阅读:
    POJ1034 The dog task
    POJ1033 Defragment
    POJ1032 Parliament
    POJ1031 Fence
    POJ1030 Rating
    POJ1029 False coin
    伪元素的使用
    伪元素选择器:before 以及 :after
    jquery html() 和text()的用法
    用CSS绘制三角形
  • 原文地址:https://www.cnblogs.com/Penn000/p/6665267.html
Copyright © 2011-2022 走看看