hdu1238(Substrings)
题目描述:
Problem 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 o
原创
2016-06-11 10:30:03 ·
1794 阅读 ·
0 评论