2019年6月1日
poj 1226 Substrings
摘要： 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 c 阅读全文
posted @ 2019-06-01 12:00 zjxxcn 阅读(113) 评论(0) 推荐(0) 编辑