后缀数组
Joyyiwei
这个作者很懒,什么都没留下…
展开
-
POJ - 3261 Milk Patterns (后缀数组求可重叠的 k 次最长重复子串)
DescriptionFarmer 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 milk f原创 2014-09-26 16:23:26 · 976 阅读 · 0 评论 -
HDU - 4552 怪盗基德的挑战书 (后缀数组)
Description “在树最美丽的那天,当时间老人再次把大钟平均分开时,我会降临在灯火之城的金字塔前,带走那最珍贵的笑容。”这是怪盗基德盗取巴黎卢浮宫的《蒙娜丽莎的微笑》这幅画时,挑战书上的内容。 但这次,怪盗基德的挑战书上出现了一串串小写字母“aaab sdfeeddd...”。柯南以小学生的眼睛,超凡高中生的头脑,快速统计各种字母频率,字符串长度,并结合挑战书出现的时间等原创 2014-09-30 22:07:16 · 957 阅读 · 0 评论 -
POJ - 3294 Life Forms
DescriptionYou may have wondered why most extraterrestrial life forms resemble humans, differing by superficial traits such as height, colour, wrinkles, ears, eyebrows and the like. A few bear n原创 2014-09-30 14:32:18 · 917 阅读 · 0 评论 -
POJ - 3415 Common Substrings(后缀数组求长度不小于 k 的公共子串的个数+单调栈优化)
DescriptionA substring of a string T is defined as:T( i, k)= TiTi+1... Ti+k-1, 1≤ i≤ i+k-1≤| T|.Given two strings A, B and one integer K, we define S, a set of triples (i, j, k):S =原创 2014-09-29 11:22:39 · 1420 阅读 · 0 评论 -
POJ - 3693 Maximum repetition substring(后缀数组求重复次数最多的连续重复子串)
DescriptionThe 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原创 2014-09-28 15:44:22 · 966 阅读 · 0 评论 -
POJ - 1743 Musical Theme (后缀数组求不可重叠最长重复子串)
DescriptionA 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原创 2014-09-25 20:55:54 · 1896 阅读 · 0 评论 -
后缀数组——处理字符串的有力工具
后缀数组和其应用学习的好文章啊转载 2014-09-25 21:00:32 · 1753 阅读 · 2 评论 -
URAL - 1297 Palindrome(后缀数组求最长回文子串)
DescriptionThe “U.S. Robots” HQ has just received a rather alarming anonymous letter. It states that the agent from the competing «Robots Unlimited» has infiltrated into “U.S. Robotics”. «U.S. R原创 2014-09-26 21:05:45 · 1200 阅读 · 0 评论 -
SPOJ - DISUBSTR Distinct Substrings(后缀数组求不相同的子串个数)
DescriptionGiven a string, we need to find the total number of its distinct substrings.InputT- number of test cases. TEach test case consists of one string, whose length is OutputFor eac原创 2014-09-26 19:03:21 · 1383 阅读 · 0 评论 -
HDU - 5008 Boring String Problem (后缀数组+二分+RMQ)
Problem DescriptionIn this problem, you are given a string s and q queries.For each query, you should answer that when all distinct substrings of string s were sorted lexicographically, which原创 2014-10-03 14:36:19 · 1479 阅读 · 0 评论