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
相關文章
相關標籤/搜索