L - Substrings POJ - 1226 （后缀数组+二分）

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 strings.ios Inp

>>阅读原文<<