E-COM-NET
首页
在线工具
Layui镜像站
SUI文档
联系我们
推荐频道
Java
PHP
C++
C
C#
Python
Ruby
go语言
Scala
Servlet
Vue
MySQL
NoSQL
Redis
CSS
Oracle
SQL Server
DB2
HBase
Http
HTML5
Spring
Ajax
Jquery
JavaScript
Json
XML
NodeJs
mybatis
Hibernate
算法
设计模式
shell
数据结构
大数据
JS
消息中间件
正则表达式
Tomcat
SQL
Nginx
Shiro
Maven
Linux
Oulipo
Oulipo
OulipoTimeLimit:3000/1000ms(Java/Other) MemoryLimit:32768/32768K(Java/Other)TotalSubmission(s):4 AcceptedSubmission(s):2ProblemDescriptionTheFrenchauthorGeorgesPerec(1936–1982)oncewroteabook,Ladis
yanghui07216
·
2015-08-03 21:00
hdoj 1686
Oulipo
【求一个串在另一串的出现次数】【KMP】
OulipoTimeLimit:3000/1000MS(Java/Others) MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):7117 AcceptedSubmission(s):2828ProblemDescriptionTheFrenchauthorGeorgesPerec(1936–1982)oncewrotea
chenzhenyu123456
·
2015-08-03 12:00
渣渣ACM日记——3461-
Oulipo
(POJ)
OulipoTimeLimit: 1000MS MemoryLimit: 65536KTotalSubmissions: 28717 Accepted: 11472DescriptionTheFrenchauthorGeorgesPerec(1936–1982)oncewroteabook,Ladisparition,withouttheletter 'e'.HewasamemberoftheOu
Sterben_Da
·
2015-07-28 20:00
HDU - 1711 - Number Sequence,1686 -
Oulipo
,2087 - 剪花布条,3746 - Cyclic Nacklace (KMP基础)
题目传送:HDU-1711-NumberSequenceAC代码:#include #include #include #include #include #include #include #include #include #include #include #include #include #include #defineLLlonglong #defineINF0x7fffffff us
u014355480
·
2015-07-27 23:00
字符串匹配
KMP
ACM
HDU
POJ_3461-
Oulipo
//没啥好说的,KMP模板题AC代码:#include #include #definemax1000005 chars[max]; chart[max]; intlen1; intlen2; intnext[max]; intsum; voidget_next() { inti=0; intj=-1; next[0]=-1; while(i
zyx520ytt
·
2015-07-22 15:00
poj 3461
Oulipo
(KMP)
题目:http://poj.org/problem?id=3461大意是这样的:在一篇没有空格的文章中找到给定的词,统计出现的次数输出。用KMP求出前缀-后缀编码,将词当做模式串在文章中不断移动寻找相同的词。#include #include #include usingnamespacestd; constintmaxn1=1e4+5,maxn2=1e6+5; chars1[maxn1],s2[
theArcticOcean
·
2015-07-09 10:00
KMP
poj
hdu1686
Oulipo
ProblemDescriptionTheFrenchauthorGeorgesPerec(1936–1982)oncewroteabook,Ladisparition,withouttheletter'e'.HewasamemberoftheOulipogroup.Aquotefromthebook:ToutavaitPairnormal,maistouts’affirmaitfaux.Tout
Kirito_Acmer
·
2015-06-12 12:00
KMP
poj3461
Oulipo
题意:一道简单的KMP题,找出第一个字符串p在第二个字符串s中出现次数。思路:找出next数组后匹配,当字符串p匹配完成后,计数器加一,然后j回溯到next[j]继续匹配。代码:#include#include#include#include#include#include#includeusingnamespacestd;#defineCLR(a,b)memset(a,b,sizeof(a))c
thessuye
·
2015-05-24 17:31
字符串
POJ 3461
Oulipo
DescriptionTheFrenchauthorGeorgesPerec(1936–1982)oncewroteabook,Ladisparition,withouttheletter 'e'.HewasamemberoftheOulipogroup.Aquotefromthebook:ToutavaitPairnormal,maistouts’affirmaitfaux.ToutavaitF
jtjy568805874
·
2015-04-24 21:00
KMP
poj
(KMP 1.2)hdu 1686
Oulipo
(计算模式串在文本串中出现的次数)
题目:OulipoTimeLimit:3000/1000MS(Java/Others) MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):5985 AcceptedSubmission(s):2404ProblemDescriptionTheFrenchauthorGeorgesPerec(1936–1982)oncewro
caihongshijie6
·
2015-04-18 11:00
[省选前题目整理][POJ 3461]
Oulipo
(KMP)
题目链接http://poj.org/problem?id=3461题目大意给出模式串W和主串T,求W在T中的出现次数。思路最基础的KMP。代码#include #include #include #include #include #defineMAXN1001000 #defineMAXM10010 usingnamespacestd; charword[MAXM],text[MAXN]
qpswwww
·
2015-04-08 08:00
POJ 3461
Oulipo
(简单kmp)
题目类型 kmp题目意思问一个最长10000的串在一个最长1000000的串中出现了多少次(可重叠)解题方法kmp的基本用法理解清楚失配函数的定义即可参考代码 -有疑问的地方在下方留言看到会尽快回复的#include #include #include usingnamespacestd; constintmaxn=1e4+10; intnext[maxn]; charw[maxn],t[
Yunyouxi
·
2015-03-18 23:00
KMP
POJ-3461
Oulipo
(KMP)
题目链接:http://poj.org/problem?id=3461题目大意:给你两个字符串p和s,求出p在s中出现的次数。思路:p在s中KMP匹配,匹配成功,再从next[last]的位置匹配即可,因为允许出现的两次有重叠的部分。//1208KB94ms #include #include #include usingnamespacestd; intn; chars[1000100],p[1
kalilili
·
2015-02-17 21:00
HDU 1689
Oulipo
【KMP】
OulipoTimeLimit:3000/1000MS(Java/Others) MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):5557 AcceptedSubmission(s):2222ProblemDescriptionTheFrenchauthorGeorgesPerec(1936–1982)oncewrotea
u013806814
·
2014-12-02 01:00
KMP
Hduoj1686 【KMP】
/*
Oulipo
TimeLimit:3000/1000MS(Java/Others)MemoryLimit:32768/32768K(Java/Others) TotalSubmission(s):5501AcceptedSubmission
u014641529
·
2014-11-01 10:00
c
字符串hash - 简单的字符匹配 --- poj 3461
Oulipo
Problem's Link:http://poj.org/problem?
·
2014-10-04 12:00
hash
HDU1686 POJ3461
Oulipo
KMP算法
题目大意:给你两个字符串,让你求出第一个字符串在第二个字符串中出现多少次。分析:KMP算法,每次匹配成功时让计数器加1即可。实现代码如下:#include #include #include usingnamespacestd; constintMAX=1000010; constintMIN=10010; charT[MAX],W[MIN]; intnext[MIN]; voidinit_nex
AC_Gibson
·
2014-09-16 10:00
HDU - 1686
Oulipo
(KMP)
ProblemDescriptionTheFrenchauthorGeorgesPerec(1936–1982)oncewroteabook,Ladisparition,withouttheletter'e'.HewasamemberoftheOulipogroup.Aquotefromthebook:ToutavaitPairnormal,maistouts’affirmaitfaux.Tout
u011345136
·
2014-09-12 09:00
POJ 3461
Oulipo
(KMP)
OulipoTimeLimit:1000MSMemoryLimit:65536KTotalSubmissions:23190Accepted:9287DescriptionTheFrenchauthorGeorgesPerec(1936–1982)oncewroteabook,Ladisparition,withouttheletter'e'.HewasamemberoftheOulipogrou
Tc_To_Top
·
2014-08-07 21:00
KMP
poj
HDU 1686
Oulipo
(KMP)
这题是个KMP模板题,具体做法就不阐述了。关于KMP,可参考从头到尾彻底理解KMP(2014年8月4日版)。题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1686#include #include chars[1000000],p[10001]; intnext[10001]; voidgetnext() { intplen=strlen(p),k=
yzj577
·
2014-08-05 18:00
C++
算法
字符串
KMP
HDU
POJ 3461
Oulipo
深刻理解KMP算法next数组含义
题目大意:在字符串2 中找 字符串1 出现的次数。OulipoTimeLimit: 1000MS MemoryLimit: 65536KTotalSubmissions: 22537 Accepted: 8989DescriptionTheFrenchauthorGeorgesPerec(1936–1982)oncewroteabook,Ladisparition,withouttheletter
Ash_Zheng
·
2014-07-21 11:00
KMP
A -
Oulipo
(KMP算法经典)
详细KMP见http://blog.csdn.net/u014665013/article/details/37995355DescriptionTheFrenchauthorGeorgesPerec(1936–1982)oncewroteabook,Ladisparition,withouttheletter'e'.HewasamemberoftheOulipogroup.Aquotefro
u014665013
·
2014-07-20 19:00
A -
Oulipo
(4.6.2)
DescriptionTheFrenchauthorGeorgesPerec(1936–1982)oncewroteabook,Ladisparition,withouttheletter'e'.HewasamemberoftheOulipogroup.Aquotefromthebook:ToutavaitPairnormal,maistouts’affirmaitfaux.ToutavaitFa
u014552726
·
2014-07-20 18:00
数据结构
C++
KMP
poj
3461
Oulipo4.6.2
Oulipo
DescriptionTheFrenchauthorGeorgesPerec(1936–1982)oncewroteabook,Ladisparition,withouttheletter'e'.HewasamemberoftheOulipogroup.Aquotefromthebook:ToutavaitPairnormal,maistouts’affirmaitfaux.ToutavaitFa
u014028231
·
2014-07-20 15:00
kmp算法(POJ 3461
Oulipo
)
http://www.cnblogs.com/dolphin0520/archive/2011/08/24/2151846.htmlhttp://www.matrix67.com/blog/archives/115OulipoTimeLimit: 1000MS MemoryLimit: 65536KTotalSubmissions: 22468 Accepted: 8962DescriptionT
u013263923
·
2014-07-20 09:00
POJ3461
Oulipo
【KMP】
OulipoTimeLimit: 1000MS MemoryLimit: 65536KTotalSubmissions: 22295 Accepted: 8905DescriptionTheFrenchauthorGeorgesPerec(1936–1982)oncewroteabook,Ladisparition,withouttheletter 'e'.HewasamemberoftheOul
u012846486
·
2014-07-17 15:00
POJ3461
hdu 1686
Oulipo
裸的KMP
OulipoTimeLimit:3000/1000MS(Java/Others) MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):4490 AcceptedSubmission(s):1772ProblemDescriptionTheFrenchauthorGeorgesPerec(1936–1982)oncewrotea
u013532224
·
2014-07-14 15:00
算法
KMP
【KMP】 POJ 3461
Oulipo
KMP模板题。。。#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #definemaxn1000005 #defineeps1e-5 #definemod10007 #defin
blankcqk
·
2014-06-26 21:00
KMP
pku
【POJ】【P3461】【
Oulipo
】【题解】【KMP】
传送门:http://poj.org/problem?id=3461蒟蒻近期要恶补字符串……,先补补KMP……Code:#include #include #include usingnamespacestd; constintmaxn=1e6+5; intnext[maxn],slen,tlen; chars[maxn],t[maxn]; intkmp(){ intans=0; for(inti
u012732945
·
2014-04-28 08:00
KMP
poj
HDOJ 1686
Oulipo
裸的KMP,但是用AC自动机做的。。。。OulipoTimeLimit:3000/1000MS(Java/Others) MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):4076 AcceptedSubmission(s):1618ProblemDescriptionTheFrenchauthorGeorgesPerec(
u012797220
·
2014-04-04 22:00
POJ 3461
Oulipo
(KMP:统计一个串出现的次数)
POJ3461
Oulipo
(KMP:统计一个串出现的次数)http://poj.org/problem?
u013480600
·
2014-04-04 12:00
ACM
HDU 1681
Oulipo
(KMP)
OulipoTimeLimit:3000/1000MS(Java/Others) MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):4023 AcceptedSubmission(s):1591ProblemDescriptionTheFrenchauthorGeorgesPerec(1936–1982)oncewrotea
u011217342
·
2014-03-18 12:00
hdu 1686
Oulipo
(KMP)
题目链接:hdu1686
Oulipo
题目大意:给出两个字符串W,T,问说T字符串中有几个子串和W字符串匹配。
u011328934
·
2014-03-17 18:00
hdu 1686
Oulipo
(简单KMP)只不过比赛的时候用了string.一直超时,改成char就一遍AC,纠结。。。
1、http://acm.hdu.edu.cn/showproblem.php?pid=16862、题目大意:这道题目太纠结了,就是一道直接用KMP模板的题目,比赛的时候居然第一次想成做for循环次的KMP,超时了,后来知道只能用一次KMP了,结果用的string一直超时,后来改成char居然一遍AC,还得好好熟悉算法题目是给出两个字符串a,b,求a在b中出现多少次3、题目:OulipoTimeL
sdjzping
·
2014-03-10 16:00
poj3461
Oulipo
,Kmp
计算串x在y中重复了多少次,可重叠。/************************************************ *Author:yew1eb *CreatedTime:2014/3/616:30:33 *FileName:poj3461.cpp *************************************************/ #include #incl
yew1eb
·
2014-03-06 16:00
寒假训练--KMP--poj3461
Oulipo
OulipoTimeLimit: 1000MS MemoryLimit: 65536KTotalSubmissions: 19729 Accepted: 7920DescriptionTheFrenchauthorGeorgesPerec(1936–1982)oncewroteabook,Ladisparition,withouttheletter 'e'.HewasamemberoftheOul
u013015642
·
2014-02-11 16:00
Oulipo
(KMP)
Oulipo
Time Limit: 1000MS Memory Limit: 65536K Total Submissions:
Simone_chou
·
2014-01-29 15:00
KMP
POJ 1961Period / POJ 2406 Power Strings / POJ 3461
Oulipo
/SDUT 2747 循环节 初涉KMP
又到了一学期一次的考试周,然后同学说数据结构要考KMP,然后训练计划上正好也有KMP就顺便看了一下。话说KMP这个算法还是挺形象的,整个算法建立在next数组之上。next[i]存储的为若在第i个字符处匹配失败,指针应回指到的位置。关于KMP的讲解,数据结构课本上已经讲得很详细了,然后网上也有很多博客讲得很不错,所以在这里就不重复了。下面推荐一下几篇不错的博客。http://www.matrix6
u012161037
·
2013-12-23 16:00
SOJ 2652:
Oulipo
题目链接:http://cstest.scu.edu.cn/soj/problem.action?id=2652 题目大意:给出一个母串和一个子串。求子串在母串出现的次数。 算法:字符串匹配模板题,可用KMP或BM算法。我用的是KMP算法。好吧。。我是不会承认我学ACM这么久但是现在才学KMP呢>_ #include constintmaxn=1100000; chara[maxn],b
frog1902
·
2013-11-08 19:00
(串的模式匹配4.6.2)POJ 3461
Oulipo
(KMP算法的应用——求一个单词在一行文本中的出现次数)
/* *POJ_3461.cpp * *Createdon:2013年10月25日 *Author:Administrator */ #include #include #include usingnamespacestd; constintmaxw=10000+10; constintmaxt=1000000+10; //统计w在s中出现的次数 intmatch(charw[],char
caihongshijie6
·
2013-10-26 22:00
POJ 3641
Oulipo
KMP 水题
http://poj.org/problem?id=3461直接KMP就好。水题#include #include constintMAXN=10000+10; constintMAXM=1000000+10; charP[MAXN],T[MAXM]; intf[MAXN],n,m,ans; voidgetFail() { f[0]=f[1]=0; for(inti=1;i
murmured
·
2013-10-19 16:00
HDU-1686
Oulipo
学习:重点理解这句话的意思:next[j]会告诉我们从哪里开始匹配 模板题。 OulipoTimeLimit:3000/1000MS(Java/Others) MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):3612 AcceptedSubmission(s):1428P
·
2013-10-15 17:00
HDU
poj 3461
Oulipo
(kmp 模板题)
题目:http://poj.org/problem?id=3461题目大意:给你两个串p、t,让你求出p在t中出现的次数。思路:kmp模板题,没什么好说的。。==代码如下:#include #include #include usingnamespacestd; charp[11111],t[1111111]; intfail[11111]; voidget_fail() { intlen=
u010794465
·
2013-10-14 22:00
poj 3461
Oulipo
(KMP)
题目链接: poj3461题目大意: 给出主串和模式串,求模式串在主串中出现的次数(部分可以重合)解题思路: KMP从主串的第一个字符开始匹配 开始是匹配成功就立刻退出,再次从上次退出的下一个字符开始匹配,TLE... 利用上next[]数组的含义,每次不全部退出,而是退出部分j=next[j]代码://FinalKmp,给出模式串和主串,求模式串在主串中出现
qq7366020
·
2013-10-03 12:00
KMP
poj
3461
poj 3461
Oulipo
(KMP裸题)
OulipoTimeLimit: 1000MS MemoryLimit: 65536KTotalSubmissions: 17928 Accepted: 7212DescriptionTheFrenchauthorGeorgesPerec(1936–1982)oncewroteabook,Ladisparition,withouttheletter 'e'.HewasamemberoftheOul
y5885922
·
2013-09-15 00:00
c
算法
ACM
POJ KMP 入门4题
poj 3461
Oulipo
最简单的KMP题,找出第一个字符串在第二个字符串中出现次数。
c3568
·
2013-08-29 10:00
poj 3461 && hdu 1686
Oulipo
(kmp)
题目链接:http://poj.org/problem?id=3461 解题报告:字符串匹配关键是next数组不好理解。 参考资料写道 (1)next[0]= -1 意义:任何串的第一个字符的模式值规定为-1。 (2)next[j]= -1 意义:模式串T中下标为j的字符,如果与首字符 相同,且j的前面的1—k个字符与开头的1—k 个字符不
ren_hui
·
2013-08-13 22:00
数据结构
字符串匹配
kmp算法
POJ 3461
Oulipo
(简单KMP)
OulipoTimeLimit: 1000MS MemoryLimit: 65536KTotalSubmissions: 17128 Accepted: 6892DescriptionTheFrenchauthorGeorgesPerec(1936–1982)oncewroteabook,Ladisparition,withouttheletter 'e'.HewasamemberoftheOul
opm777
·
2013-08-05 14:00
KMP
poj
对比剪花布条
字符串 KMP Trie AC自动机 后缀数组
A.
Oulipo
貌似是POJ的,以前做过。直接用KMP水过了。B.统计难题是HDU的吧,题意就是求一些串是另一些串前缀的个数,直接用Trie搞。
kdqzzxxcc
·
2013-07-22 17:00
POJ 3461
Oulipo
KMP
题目地址: http://poj.org/problem?id=3461基本KMP————AC代码:#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include usingn
ilovexiaohao
·
2013-07-21 10:00
KMP
上一页
1
2
3
4
5
下一页
按字母分类:
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
其他