后缀数组
Kirito_Acmer
这个作者很懒,什么都没留下…
展开
-
spoj687 REPEATS - Repeats (后缀数组+rmq)
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 example, the string s = abaabaabaaba is a (4,3)-repeat with t = aba as原创 2016-04-29 18:15:00 · 524 阅读 · 0 评论 -
poj3693 Maximum repetition substring (后缀数组+rmq)
Description The repetition number of a string is defined as the maximum number R such that the string can be partitioned into R same consecutive substrings. For example, the repetition number of "a原创 2016-04-29 22:59:31 · 460 阅读 · 0 评论 -
poj3415 Common Substrings (后缀数组+单调队列)
Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 9414 Accepted: 3123 Description A substring of a string T is defined as: T(i, k)=TiTi+1...Ti+k-1, 1≤i≤i+k-1≤|T|.原创 2016-04-30 17:02:37 · 616 阅读 · 0 评论 -
UVA 11475 Extend to Palindrome (kmp || manacher || 后缀数组)
题目链接:点击打开链接 题意:给你一个串,让你在串后面添加尽可能少的字符使得这个串变成回文串。 思路:这题可以kmp,manacher,后缀数组三种方法都可以做,kmp和manacher效率较高,时间复杂度是O(n),后缀数组时间复杂度是O(nlogn).思路是求出元串的后缀和反串的前缀匹配的最大长度。用后缀数组的时候求出l=lcp(i,len+1),判断l+i是不是等于len,如果等于那么就原创 2016-05-01 15:53:06 · 583 阅读 · 0 评论 -
poj3581 Sequence (后缀数组)
Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 6305 Accepted: 1364 Case Time Limit: 2000MS Description Given a sequence, {A1, A2, ..., An} which is guaranteed原创 2016-05-02 20:46:07 · 528 阅读 · 0 评论