
kmp
文章平均质量分 77
viva_la_vida__
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
poj2406 power strings
Power StringsTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 48385 Accepted: 20137DescriptionGiven two strings a and b we define a*b to be their concate原创 2017-05-29 12:29:30 · 198 阅读 · 0 评论 -
hdu 3336 Count the string
Count the stringTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10144 Accepted Submission(s): 4745Problem DescriptionIt is we原创 2017-06-03 09:35:38 · 219 阅读 · 0 评论 -
hdu1841Find the Shortest Common Superstring
Find the Shortest Common SuperstringTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 2062 Accepted Submission(s): 570Problem DescriptionThe sh...原创 2017-05-31 15:08:32 · 366 阅读 · 0 评论 -
hdu2594 Simpsons’ Hidden Talents
Problem DescriptionHomer: Marge, I just figured out a way to discover some of the talents we weren’t aware we had.Marge: Yeah, what is it?Homer: Take me for example. I want to find out if I ha原创 2017-05-30 16:20:25 · 219 阅读 · 0 评论 -
HDU3746:Cyclic Nacklace
Problem DescriptionCC 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 th...原创 2017-05-30 09:41:18 · 447 阅读 · 0 评论 -
hust 1010 minimum length 循环节
1010 - The Minimum LengthTime Limit: 1s Memory Limit:128MBSubmissions: 2598 Solved: 970 Description There is a string A. The length of A is less than 1,000,000. I rewrite it again and ag原创 2017-05-30 09:36:23 · 253 阅读 · 0 评论 -
poj 3461
OulipoTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 40525 Accepted: 16304DescriptionThe French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. H...原创 2017-05-29 14:04:16 · 202 阅读 · 0 评论 -
poj 2752 找到所有的公共前后缀
Seek the Name, Seek the FameTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 19251 Accepted: 9898DescriptionThe little cat is so famous, that many couple原创 2017-05-29 13:17:17 · 315 阅读 · 0 评论 -
poj1961 period
PeriodTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 17890 Accepted: 8621DescriptionFor each prefix of a given string S with N characters (each charact原创 2017-05-29 12:54:18 · 249 阅读 · 0 评论 -
Bazinga HDU - 5510
Ladies and gentlemen, please sit up straight. Don't tilt your head. I'm serious. For nn given strings S1,S2,⋯,SnS1,S2,⋯,Sn, labelled from 11 to nn, you should find the largest i (1≤i≤n)i原创 2018-01-17 11:29:43 · 336 阅读 · 0 评论