KMP
关注
分享
扫一扫
文章平均质量分 84
_OTTFF
这个作者很懒，什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
POJ_2752_SeekTheName,SeekTheFame
Seek the Name, Seek the FameTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 14394 Accepted: 7186DescriptionThe little cat is so famous, that many coup原创 2015-08-24 16:14:00 · 402 阅读 · 0 评论 -
POJ_3080_BlueJeans
Blue JeansTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14291 Accepted: 6361DescriptionThe Genographic Project is a research partnership between IBM原创 2015-08-17 14:50:47 · 387 阅读 · 0 评论 -
HDU_1711_NumberSequence
Number SequenceTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 18002 Accepted Submission(s): 7874Problem DescriptionGiven tw原创 2016-02-21 21:28:58 · 319 阅读 · 0 评论 -
HDU_1686_POJ_3461_Oulipo
OulipoTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8752 Accepted Submission(s): 3534Problem DescriptionThe French author G原创 2016-02-21 21:35:22 · 341 阅读 · 0 评论 -
POJ_2406_PowerStrings
Power StringsTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 40456 Accepted: 16833DescriptionGiven two strings a and b we define a*b to be their conca原创 2016-02-21 21:41:22 · 363 阅读 · 0 评论 -
LA_3026_HDU_1358_Period
这个题目问一个串的所有可能的重复单元长度及重复的次数枚举串匹配好像并不能过这个题目的数据这个题目其实要对KMP的next数组有一定的理解123123123这样的串会在next数组形成怎样的形式其实是解决这个题目的关键#include #include using namespace std;const int MN=1e6+5;char s1[MN];int原创 2016-02-21 22:02:48 · 476 阅读 · 0 评论