2016年6月29日
spoj687 后缀数组重复次数最多的连续重复子串
摘要： REPEATS - Repeats no tags A string s is called an (k,l)-repeat if s is obtained by concatenating k>=1 times some seed string t with length l>=1. For e 阅读全文
posted @ 2016-06-29 18:35 sweat123 阅读(726) 评论(0) 推荐(0)
spoj705 后缀数组求不同子串的个数
摘要： http://www.spoj.com/problems/SUBST1/en/ 题目链接 SUBST1 - New Distinct Substrings no tags Given a string, we need to find the total number of its distinct 阅读全文
posted @ 2016-06-29 15:25 sweat123 阅读(358) 评论(0) 推荐(0)