摘要： 1.链接地址：http://poj.org/problem?id=12262.题目：SubstringsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 10252Accepted: 3519DescriptionYou 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 substr 阅读全文