
后缀数组
文章平均质量分 67
LeeBooL
这个作者很懒,什么都没留下…
展开
-
POJ 1743 Musical Theme
Description A musical melody is represented as a sequence of N (1<=N<=20000)notes that are integers in the range 1..88, each representing a key on the piano. It is unfortunate but true that this repre原创 2015-10-10 20:58:43 · 244 阅读 · 0 评论 -
SPOJ DISUBSTR Distinct Substrings
Description Given a string, we need to find the total number of its distinct substrings.InputT- number of test cases. T<=20; Each test case consists of one string, whose length is <= 1000OutputFor ea原创 2015-10-10 21:23:59 · 286 阅读 · 0 评论 -
POJ 2406 Power Strings
Description Given two strings a and b we define a*b to be their concatenation. For example, if a = “abc” and b = “def” then a*b = “abcdef”. If we think of concatenation as multiplication, exponentiati原创 2015-10-10 21:33:00 · 239 阅读 · 0 评论 -
POJ 3261 Milk Patterns
POJ 3261 Description Farmer John has noticed that the quality of milk given by his cows varies from day to day. On further investigation, he discovered that although he can’t predict the quality of m原创 2015-10-10 21:10:50 · 267 阅读 · 0 评论 -
后缀数组
2009年国家集训队论文 关于后缀数组的实现论文里都讲的的很清楚了,个人觉得后缀数组重点应用的是基数排序思想,跟height数组 两个数组不要弄混: sa[i] 排名i的suffix的起始位置是sa[i]。 rank[i] suffix(i)的排名为rank[i]。 两个比较流行的算法一个是倍增法一个是DC3算法原创 2015-10-10 20:37:23 · 304 阅读 · 0 评论