在网上看到这个题目要用到后缀树

    *  Search for strings:
          o Check if a string P of length m is a substring in O(m) time.
          o Find all z occurrences of the patterns P1,...,Pq of total length m as substrings in O(m + z) time.
          o Search for a regular expression P in time expected sublinear on n.
          o Find for each suffix of a pattern P, the length of the longest match between a prefix of P[i...m] and a substring in D in Θ(m) time. This is termed the matching statistics for P.
    * Find properties of the strings:
          o Find the longest common substrings of the string Si and Sj in Θ(ni + nj) time.
          o Find all maximal pairs, maximal repeats or supermaximal repeats in Θ(n + z) time.
          o Find the Lempel-Ziv decomposition in Θ(n) time.
          o Find the longest repeated substrings in Θ(n) time.
          o Find the most frequently occurring substrings of a minimum length in Θ(n) time.
          o Find the shortest strings from Σ that do not occur in D, in O(n + z) time, if there are z such strings.
          o Find the shortest substrings occurring only once in Θ(n) time.
          o Find, for each i, the shortest substrings of Si not occurring elsewhere in D in Θ(n) time.

RT，有资料的发我邮箱,谢谢 kdy71107216@yahoo.cn