2018年1月11日
SPOJ 8222 Substrings 后缀自动机
摘要： You are given a string S which consists of 250000 lowercase latin letters at most. We define F(x) as the maximal number of times that some string with 阅读全文
posted @ 2018-01-11 18:48 wls001 阅读(127) 评论(0) 推荐(0) 编辑