zoukankan      html  css  js  c++  java
  • HDOJ_ACM_Common Subsequence

    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
     
     
    Code
    View Code
    Key points
    If you realize the state transition equation, you will solve it.
    Take abcfbc abfcb for example, the result is as follow, and the state transition equation is
    if s1[i]=s[j] f[i][j]=f[i-1][j-1] + 1
    if s1[i]!=[j] f[i][j]=max(f[i-1][j], f[i][j-1])
      
        a b c f b c
      0 0 0 0 0 0 0
    a 0 1 1 1 1 1 1
    b 0 1 2 2 2 2 2
    f 0 1 2 2 3 3 3
    c 0 1 2 3 3 3 4
    b 0 1 2 3 3 3 4
  • 相关阅读:
    poj 1860 最短路—Bellman-Ford算法
    poj 3083 dfs+bfs最短路
    poj 2049 Finding Nemo(bfs+优先队列)
    Codeforces 685B 树形dp
    Codeforces 679B
    hdu 5695 拓扑排序裸题
    hdu 5690 矩阵快速幂/循环节
    《概率》第一卷( 修订和补充第三版)施利亚耶夫著 周概荣译本 勘误
    HDU 2124 Repair the Wall
    HDU 1198 Farm Irrigation
  • 原文地址:https://www.cnblogs.com/chuanlong/p/2769909.html
Copyright © 2011-2022 走看看