POJ 1226 Substrings
摘要：
SubstringsTime Limit:1000MSMemory Limit:10000KTotal Submissions:10262Accepted:3525DescriptionYou 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.InputThe first 阅读全文
posted @ 2013-06-03 16:36 lzm风雨无阻 阅读(548) 评论(0) 推荐(0) 编辑
