随笔分类 -  KMP

Shift - And字符串快速处理 hdu5972+cf
摘要：基础知识介绍 KMP就是不断往前找1的位置，而ShiftAnd经过三步处理已经完成这个迭代的过程了 如果匹配两个字符集有限的字符串的话，那么Shift-And比kmp要快，找区间内某字符串出现的数目也可以只与这个字符串的长度有关。。 Regular Number Time Limit: 2000/1 阅读全文
posted @ 2018-02-07 22:12 Billyshuai 阅读(251) 评论(0) 推荐(0)
poj1699 KMP+壮压DP
摘要：Best Sequence Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 6338 Accepted: 2461 Description The twenty-first century is a biology-technol 阅读全文
posted @ 2017-08-21 00:46 Billyshuai 阅读(269) 评论(0) 推荐(0)
poj3376 KMP+字典树求回文串数量(n*n)
摘要：Finding Palindromes Time Limit: 10000MS Memory Limit: 262144K Total Submissions: 4043 Accepted: 746 Case Time Limit: 2000MS Description A word is call 阅读全文
posted @ 2017-08-20 22:32 Billyshuai 阅读(187) 评论(0) 推荐(0)
hdu6153KMP
摘要：A Secret Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 256000/256000 K (Java/Others)Total Submission(s): 612 Accepted Submission(s): 237 Proble 阅读全文
posted @ 2017-08-19 22:35 Billyshuai 阅读(201) 评论(0) 推荐(0)