![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
kmp算法
圣诞老人家
这个作者很懒,什么都没留下…
展开
-
poj2406--kmp next的应用
Power Strings Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 44606 Accepted: 18632 Description Given two strings a and b we define a*b to be their concate原创 2016-09-12 11:26:19 · 234 阅读 · 0 评论 -
poj 1961kmp next的再理解
Period Time Limit: 3000MS Memory Limit: 30000K Total Submissions: 16679 Accepted: 8021 Description For each prefix of a given string S with N characters (each charact原创 2016-09-12 12:08:31 · 201 阅读 · 0 评论 -
Problem E Red Rover kmp
One of our older Mars Rovers has nearly completed its tour of duty and is awaiting instructions for one last mission to explore the Martian surface. The survey team has picked a route and has entrus原创 2017-03-26 16:57:49 · 408 阅读 · 0 评论 -
hdu 6068 Classic Quotation
这个博客讲的非常好 点击打开链接 Description 给出一个长度为n的字符串S和一个长度为m的字符串T,有q次查询,每次查询给出一个区间[L,R],求对所有1 Input 第一行一整数T表示用例组数,每组用例首先输入三个整数n,m,q分别表示S串串长和T串串长以及查询次数,之后输入串S和串T,两个串均由小写字母构成,最后q行每行输入两个整数L,R表示一次查询 (1 O转载 2017-08-30 15:38:47 · 334 阅读 · 0 评论