M - Substrings
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.You are given a number
阅读背景：
M - Substrings （KMP ——暴力枚举）
来源：互联网
分享到：
