KMP
xiaoxiede_wo
这个作者很懒,什么都没留下…
展开
-
Cyclic Nacklace
CC always becomes very depressed at the end of this month, he has checked his credit card yesterday, without any surprise, there are only 99.9 yuan left. he is too distressed and thinking about how to原创 2017-11-02 13:29:54 · 283 阅读 · 0 评论 -
Oulipo(Kmp模板)
Time limit 1000 ms Memory limit 32768 kB The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo group. A quote from...原创 2017-10-25 21:05:22 · 262 阅读 · 0 评论 -
Power Strings
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, exponentiation by a non-原创 2017-11-02 20:31:18 · 548 阅读 · 0 评论 -
Period
For each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic string. That is, for each i (2原创 2017-11-02 20:38:25 · 308 阅读 · 0 评论 -
KMP理解
处理字符串匹配问题,最简单直接的方法是BF算法,原串用i表示指向的字符位置,模式串用j表示。开始从i=0,j=0比较str[i]和mo[j]是否相等。若相等i++,j++。若不相等,j重新指向0位置,i从第二个str[1]开始......。这样时间复杂度为l1*l2.。比较耗时。 而KMP利用模式串相同的前缀后缀。j指针回溯,i指针不回溯。因为匹配到j时说明前j-1个串一定是全匹配的,当匹配出现原创 2017-10-25 21:09:48 · 156 阅读 · 0 评论 -
CodeForces - 471D
D. MUH and Cube Wallstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant ...原创 2018-04-21 18:54:21 · 222 阅读 · 0 评论 -
Sequence I
题目链接·:http://acm.hdu.edu.cn/showproblem.php?pid=5918 求 问从a串中每隔p取数字,有多少个可与b串匹配 思路:用kmp可计算连续的a串中有多少个b串,可将每p个数字取出组成连续的新串,共可取出p条新串,对每条新串kmp再求和即可。 #include <iostream> #include <cstdio> ...原创 2018-09-20 19:12:22 · 258 阅读 · 0 评论