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
  • 相关阅读:
    【转载】zookeeper数据模型
    java.util.logging使用笔记2
    spark提交应用的方法(spark-submit)
    spark集群模式概述
    [spark]spark 编程教程
    [spark]Spark Streaming教程
    使用github pages创建博客
    spark 编程教程
    Spark编程指南V1.4.0(翻译)
    mysql基本操作
  • 原文地址:https://www.cnblogs.com/chuanlong/p/2769909.html
Copyright © 2011-2022 走看看