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
  • 相关阅读:
    获取字符串中指定字符间的字符串
    删除一个xml
    读取文件夹下所有文件名,饼写入xml
    在现有xml增加一个新的节点
    某一时间执行某方法c# 写在global里
    Ubuntu下安装Adobe Flash Player
    Josephus(约瑟夫环)
    html5综合属性图表
    第一步
    框架学习的个人见解
  • 原文地址:https://www.cnblogs.com/chuanlong/p/2769909.html
Copyright © 2011-2022 走看看