字符串工具
关注
分享
扫一扫
文章平均质量分 90
jiangzh7
这个作者很懒，什么都没留下…
展开
-
【KMP】Oulipo POJ3461
OulipoTime Limit: 1000MS Memory Limit: 65536KDescriptionThe French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a原创 2013-03-31 13:52:08 · 622 阅读 · 0 评论 -
【后缀数组】Milk Patterns POJ3261
Milk PatternsTime Limit: 5000MS Memory Limit: 65536KCase Time Limit: 2000MSDescriptionFarmer John has noticed that the quality of milk given by his cows varies from原创 2013-04-09 19:58:29 · 803 阅读 · 0 评论 -
【后缀数组】【最长回文子串】Palindrome Ural_1297
Ural_1297. PalindromeTime Limit: 1.0 secondMemory Limit: 64 MBThe “U.S. Robots” HQ has just received a rather alarming anonymous letter. It states that the agent from the competing «Robots原创 2013-04-11 15:01:05 · 658 阅读 · 0 评论 -
【后缀数组】【不同子串个数】DISUBSTR spoj694/705
694 / 705. Distinct SubstringsProblem code: DISUBSTRGiven a string, we need to find the total number of its distinct substrings.InputT- number of test cases. TEach test case consists原创 2013-04-23 17:46:53 · 670 阅读 · 0 评论 -
【kmp】【后缀数组】【连续重复子串】Power Strings POJ2406
Power StringsTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 25921 Accepted: 10857DescriptionGiven two strings a and b we define a*b to be their conca原创 2013-04-24 09:08:28 · 694 阅读 · 0 评论 -
【省选】【后缀数组】模板
昨天试着写了一下后缀数组，蛋疼了……今天又看了一下LHQ大神的pdf，感触很深又把代码看了一遍，又理解了一下把昨天的代码修改了一下，把两个for改成了memset，去掉了一个所谓的wv数组（他用wv数组只是后面可以直接用wv[i]表示x[y[i]]），直接改成嵌套成x[y[i]]代码模板【原数组 s 要在最后加上一个 ' $ ' 】i原创 2013-04-10 08:37:58 · 553 阅读 · 0 评论 -
【后缀数组】【最长公共子串】Long Long Message POJ2774
Long Long MessageTime Limit: 4000MS Memory Limit: 131072KTotal Submissions: 17135 Accepted: 6950Case Time Limit: 1000MSDescriptionThe little cat is majori原创 2013-04-24 16:06:58 · 591 阅读 · 0 评论