POJ1226 Substrings (后缀数组)

Description You are given a number of case-sensitive strings of alphabetic characters, find the largest string X, such that either X, or its inverse can be found as a substring of any of the given str
相关文章
相关标签/搜索