kmp
黑码
这个作者很懒,什么都没留下…
展开
-
codeforces MUH and Cube Walls (kmp)
Polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got hold of lots of wooden cubes somewhere. They started making cube towers by placing the cubes原创 2017-03-19 12:18:30 · 603 阅读 · 0 评论 -
hdu 6153 拓展kmp
类似于模板题了扩展KMP: 给出模板串A和子串B,长度分别为lenA和lenB,要求在线性时间内,对于每个A[i](0<=i#include <bits/stdc++.h>using namespace std;typedef long long ll;const int maxn=1e6+10; //字符串长度最大值 int nxt[maxn],ex[maxn]; //ex原创 2017-08-20 10:33:55 · 506 阅读 · 0 评论 -
poj 3080 Blue Jeans 拓展kmp
The Genographic Project is a research partnership between IBM and The National Geographic Society that is analyzing DNA from hundreds of thousands of contributors to map how the Earth was populated. As原创 2017-08-23 16:31:38 · 340 阅读 · 0 评论 -
poj 2752 (找既是前缀又是后缀的串的长度)kmp/拓展kmp
The little cat is so famous, that many couples tramp over hill and dale to Byteland, and asked the little cat to give names to their newly-born babies. They seek the name, and at the same time seek the原创 2017-08-23 15:39:59 · 527 阅读 · 0 评论 -
poj 2406 最小循环节kmp
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-n原创 2017-08-23 15:32:09 · 428 阅读 · 0 评论 -
hust 1010 最小循环节
There is a string A. The length of A is less than 1,000,000. I rewrite it again and again. Then I got a new string: AAAAAA…… Now I cut it from two different position and get a new string B. Then, give原创 2017-08-23 15:30:24 · 335 阅读 · 0 评论 -
hdu 1358 kmp 求循环节
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-08-23 15:28:15 · 297 阅读 · 0 评论 -
hdu 3746 kmp求最小循环节
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-08-23 15:23:33 · 347 阅读 · 0 评论 -
计蒜客 B kmp基础 kmp模板
弄出来父串一个kmp计数就好#include <bits/stdc++.h>using namespace std;const int maxn=1e6+10;int w[maxn];int f[maxn]; void getfill(string s) { memset(f,0,sizeof(f)); for(int i=1;i<s.size();i++)原创 2017-05-20 21:11:40 · 587 阅读 · 0 评论 -
codeM 美团b轮 E 子串
时间限制:1秒 空间限制:32768K给出一个正整数n,我们把1..n在k进制下的表示连起来记为s(n,k),例如s(16,16)=123456789ABCDEF10, s(5,2)=11011100101。现在对于给定的n和字符串t,我们想知道是否存在一个k(2 ≤ k ≤ 16),使得t是s(n,k)的子串。 输入描述: 第一行一个整数n(1 ≤ n ≤ 50,000)。 第二行原创 2017-07-04 01:14:17 · 368 阅读 · 0 评论 -
qduoj kmp加剪枝
蒸鱼的一个简单签到题 发布时间: 2017年6月11日 17:59 最后更新: 2017年6月11日 18:10 时间限制: 1000ms 内存限制: 128M描述 这天蒸鱼老师碰到了暴力凡的一个题,“这题肯定能暴力” 这个想法出现在了他的脑海。但是julyc鉴于某凡的暴力过算我输这个根本理念,怎么可能让你随随便便过呢?于是,他将这个题做了平衡树套替罪羊树套喜羊羊树套圣诞树套动态仙人原创 2017-06-12 00:38:56 · 492 阅读 · 0 评论 -
codeforces 494B kmp+dp
Hamed has recently found a string t and suddenly became quite fond of it. He spent several days trying to find all occurrences of t in other strings he had. Finally he became tired and started thinking原创 2017-04-27 01:04:49 · 443 阅读 · 0 评论 -
[BZOJ3942][Usaco2015 Feb]Censoring(栈+kmp)
题解首先kmp求出来失配函数,然后暴力匹配。 如果当前位可以匹配,那么将其压入栈中;如果不能匹配,蹦到它的失配开始匹配;如果有一个完整的子串被压入栈中了,暴力将这个子串弹出。 注意弹出了一个串了之后要恢复到栈顶元素之前匹配到的位置 。 这样的话最终弹出的都是合法的串,没有弹出的就是无法匹配的。#include#include#include#include#incl转载 2017-11-01 21:41:12 · 255 阅读 · 0 评论