晓风残月xj

近来一直想学习后缀数组，找到一种高效的实现方便的后缀数组算法，于是自然找到国家集训队论文-《后缀数组——处理字符串的有力工具》，内容大致可以看懂，但是由于算法基础以及读识代码的能力确实有限，一直没能看懂里面的2倍增算法。2倍增算法本身并不难理解，但是罗穗骞那个简洁高效的代码着实读起来很是吃力。见贤思齐焉，这几天一定要读懂！！！        首先我来描叙一下后缀数组的2倍增算法。来看看几个相关

ReincarnationTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 1305    Accepted Submission(s): 448Problem DescriptionNow you are back

Front compressionTime Limit: 5000/5000 MS (Java/Others)    Memory Limit: 102400/102400 K (Java/Others)Total Submission(s): 623    Accepted Submission(s): 255Problem DescriptionFront compre

Musical ThemeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 15387 Accepted: 5321DescriptionA musical melody is represented as a sequence of N (1<=N<=2000

最长回文Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5765    Accepted Submission(s): 1957Problem Description给出一个只由小写英文字符a,b,c...y,z

Milk PatternsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 8133 Accepted: 3712Case Time Limit: 2000MSDescriptionFarmer John has noticed that the

Longest Common SubstringTime Limit: 8000/4000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3218    Accepted Submission(s): 1164Problem DescriptionGiven

Boring countingTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1229    Accepted Submission(s): 487Problem Description035 now faced a

何为回文串？       众所周知，回文串就是左右对称的字符串。 给定一个字符串，要求其中的最长回文子串。这是一个比较简单基本的问题。1.暴力枚举。枚举以每个字符为中心，看左右延伸的最长回文串，这里注意分奇偶，总的时间复杂度为O(N^N) .这是最简单最基本的算法，通常是不可取的。2.后缀数组。将原字符串翻过来接在新字符串的后面，中间用某一个特殊的字符串隔开，这样问题就变成了求新字