数据结构-KMP
文章平均质量分 89
普通网友
这个作者很懒,什么都没留下…
展开
-
hdu3613(扩展KMP)
Best RewardTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 417 Accepted Submission(s): 169Problem DescriptionAfter an uphill batt原创 2013-08-25 19:20:51 · 854 阅读 · 0 评论 -
hdu1358(KMP+最小循环节)
PeriodTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2049 Accepted Submission(s): 1010Problem DescriptionFor each prefix of a gi原创 2013-08-16 19:58:06 · 792 阅读 · 0 评论 -
hdu2087(KMP)
剪花布条Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6341 Accepted Submission(s): 4225Problem Description一块花布条,里面有些图案,另有一块直接可用的小饰条原创 2013-08-16 18:37:09 · 821 阅读 · 1 评论 -
poj2406(KMP)
Power StringsTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 27614 Accepted: 11566DescriptionGiven two strings a and b we define a*b to be their concatena原创 2013-08-16 16:25:09 · 789 阅读 · 0 评论 -
hdu3336(KMP)
Count the stringTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3245 Accepted Submission(s): 1513Problem DescriptionIt is well kn原创 2013-08-16 15:26:53 · 787 阅读 · 0 评论 -
poj2752(KMP)
Seek the Name, Seek the FameTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 10065 Accepted: 4835DescriptionThe little cat is so famous, that many couples原创 2013-08-16 23:03:17 · 822 阅读 · 0 评论 -
poj3461(KMP)
OulipoTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17587 Accepted: 7059DescriptionThe French author Georges Perec (1936–1982) once wrote a book, La d原创 2013-08-16 16:58:49 · 826 阅读 · 0 评论 -
hdu2328(KMP+枚举)
Corporate IdentityTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 186 Accepted Submission(s): 89Problem DescriptionBeside other s原创 2013-08-17 00:25:30 · 855 阅读 · 0 评论 -
hdu3746(KMP)
Cyclic NacklaceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1875 Accepted Submission(s): 825Problem DescriptionCC always becom原创 2013-08-16 14:46:37 · 843 阅读 · 0 评论 -
hdu2594(KMP)
Simpsons’ Hidden TalentsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1781 Accepted Submission(s): 649Problem DescriptionHomer:原创 2013-08-16 12:53:18 · 754 阅读 · 0 评论 -
hdu3080(KMP+枚举)
Blue JeansTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10119 Accepted: 4280DescriptionThe Genographic Project is a research partnership between IBM and原创 2013-08-17 00:33:12 · 812 阅读 · 0 评论 -
hdu3374(最小表示法+KMP)
String ProblemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1296 Accepted Submission(s): 585Problem DescriptionGive you a strin原创 2013-08-17 14:20:17 · 896 阅读 · 0 评论 -
求最长回文子串读书笔记
何为回文串? 众所周知,回文串就是左右对称的字符串。 给定一个字符串,要求其中的最长回文子串。这是一个比较简单基本的问题。1.暴力枚举。枚举以每个字符为中心,看左右延伸的最长回文串,这里注意分奇偶,总的时间复杂度为O(N^N) .这是最简单最基本的算法,通常是不可取的。2.后缀数组。将原字符串翻过来接在新字符串的后面,中间用某一个特殊的字符串隔开,这样问题就变成了求新字原创 2013-08-24 22:25:49 · 1073 阅读 · 0 评论