KMP
文章平均质量分 61
KetchupZ
退役acmer一名,CCPC银+ICPC铜(欢迎大家访问我的Github地址:https://github.com/LieLieLiekey)
展开
-
HDU - 4300(扩展kmp 求后缀的最大前缀)
Clairewd is a member of FBI. After several years concealing in BUPT, she intercepted some important messages and she was preparing for sending it to ykwd. They had agreed that each letter of these ...原创 2018-11-07 19:03:42 · 277 阅读 · 0 评论 -
HDU2594 (kmp,求两字符串的前后缀相同长度最大,水题)
Homer: Marge, I just figured out a way to discover some of the talents we weren’t aware we had.Marge: Yeah, what is it?Homer: Take me for example. I want to find out if I have a talent in po...原创 2018-11-07 13:50:44 · 751 阅读 · 0 评论 -
HDU - 3336(KMP next数组意义,水题)
Count the stringHDU - 3336It is well known that AekdyCoin is good at string problems as well as number theory problems. When given a string s, we can write down all the non-empty prefixes of thi...原创 2018-11-07 13:40:07 · 218 阅读 · 0 评论 -
H - Seek the Name, Seek the Fame POJ - 2752(找到所有相同的前缀和后缀)
题目链接http://poj.org/problem?id=2752题意:给你一个字符串str 找到一个字符串集合S ,集合内的字符串都为str的前缀和后缀思路:如果这个字符串s在这个集合的话,那么s肯定是字符串str的一个匹配(⊙﹏⊙)能理解我意思吧So KMP模板#include<stdio.h>#include<string...原创 2018-10-14 17:25:56 · 231 阅读 · 0 评论 -
E - Period HDU - 1358 (找出字符串的最小周期)(解释题意 并且数学逻辑方法解题)
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 ...原创 2018-09-25 14:30:38 · 227 阅读 · 0 评论 -
SCU - 4438 (KMP)
SCU - 4438 (KMP)Censorfrog is now a editor to censor so-called sensitive words (敏感词).She has a long text pp. Her job is relatively simple – just to find the first occurence of sensitive word ww and...原创 2019-04-23 20:49:09 · 35829 阅读 · 0 评论 -
KMP算法之next函数解释(大量的反证法 和数学归纳法来袭)
先放get_nextval()函数的代码void get_nextval(const char str[],int *net){ net[0]=-1; int j=0,k=-1,len; len=strlen(str); while(j<len) { if(k==-1||str[j]==str[k]) n...原创 2018-09-19 11:32:40 · 463 阅读 · 0 评论 -
扩展KMP
前述:之前写过扩展kmp的题,但记忆不太深刻又忘记了,自己的模板上也没解释,那么这里就写一下吧,弥补之前的懒惰。初学者不建议看。自我对扩展KMP的理解: 自我觉得扩展KMP与mannacher算法都差不多,都是利用之前已经计算过的地方,去获取一个已经计算过的长度,然后再暴力计算未计算的长度。而kmp与扩展kmp有很大的不同EXkmp:s[i...k+...原创 2019-08-06 23:29:19 · 104 阅读 · 0 评论