KMP
关注
分享
扫一扫
文章平均质量分 79
974792789
不要在能吃苦的年纪追求安逸。
展开
-
Power Strings +poj+KMP
Power StringsTime Limit: 3000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64u[Submit] [Go Back] [Status] DescriptionGiven two strings a and b we d原创 2014-07-23 00:54:40 · 462 阅读 · 0 评论 -
Period +uvalive+next数组
PeriodTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] DescriptionFor each prefix of a given string S w原创 2014-07-23 09:21:14 · 435 阅读 · 0 评论 -
Oulipo poj+KMP水题
OulipoTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 22728 Accepted: 9084DescriptionThe French author Georges Perec (1936–1982) once wrote a book, La d原创 2014-07-22 23:59:33 · 420 阅读 · 0 评论 -
Seek the Name, Seek the Fame +poj+next数组的理解
Seek the Name, Seek the FameTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 11717 Accepted: 5730DescriptionThe little cat is so famous, that many couple原创 2014-07-22 23:58:45 · 509 阅读 · 0 评论 -
FZU 1901+kmp的next数组的应用
Accept: 122 Submit: 330Time Limit: 1000 mSec Memory Limit : 32768 KB Problem DescriptionFor each prefix with length P of a given string S,ifS[i]=S[i+P] for i in [0..SIZE(S)-p-1], t原创 2014-07-27 20:21:31 · 458 阅读 · 0 评论