字符串
文章平均质量分 77
_大太阳_
有梦想就去追
展开
-
poj 1002 487-3279
http://poj.org/problem?id=1002 487-3279 Description Businesses like to have memorable telephone numbers. One way to make a telephone number memorable is to have it spell a memorable word or原创 2015-10-23 17:17:18 · 398 阅读 · 0 评论 -
poj 1961 Period(kmp)
http://poj.org/problem?id=1961 Period Description For each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whe原创 2015-09-28 19:54:47 · 351 阅读 · 0 评论 -
hdu 3746 Cyclic Nacklace (kmp)
http://acm.hdu.edu.cn/showproblem.php?pid=3746 Cyclic Nacklace Problem Description CC always becomes very depressed at the end of this month, he has checked his credit card yesterday, witho原创 2015-09-28 16:16:28 · 377 阅读 · 0 评论 -
poj 2087 剪花布条(kmp)
http://acm.hdu.edu.cn/showproblem.php?pid=2087 剪花布条 Problem Description 一块花布条,里面有些图案,另有一块直接可用的小饰条,里面也有一些图案。对于给定的花布条和小饰条,计算一下能从花布条中尽可能剪出几块小饰条来呢? Input 输入中含有一些数据,分别是成对出现的花布条和小饰条,其布条都是用原创 2015-09-28 14:37:00 · 652 阅读 · 0 评论 -
poj 3461 Oulipo(KMP)
http://poj.org/problem?id=3461 Oulipo Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 29907 Accepted: 12049 Description The French author Georges Pe原创 2015-09-28 14:10:18 · 341 阅读 · 0 评论 -
hdu 1711 Number Sequence (kmp)
http://acm.hdu.edu.cn/showproblem.php?pid=1711 kmp模板 #include #include #include #include #include #include using namespace std; typedef long long LL; #define N 1100000 #define INF 0x3f3f3f3f原创 2016-05-05 16:29:36 · 457 阅读 · 0 评论 -
hdu 3336 Count the string (kmp + dp)
http://acm.hdu.edu.cn/showproblem.php?pid=3336 题意:给出一个长度为n的字符串,求出该字符串的所有前缀出现的总次数 思路:kmp求出该字符串的next数组,第i个位置dp[i]可有dp[next[i]]+1得到 #include #include #include #include #include using namespace s原创 2016-05-12 19:01:01 · 511 阅读 · 0 评论 -
hdu 3374 String Problem (最大最小表示法)
http://acm.hdu.edu.cn/showproblem.php?pid=3374 SKYLONG 1 KYLONGS 2 YLONGSK 3 LONGSKY 4 ONGSKYL 5 NGSKYLO 6 GSKYLON 7 题意:输出的是最小字典序的编号,最小字典序个数,最大字典序编号,最大字典序个数 求有几个这样的字符串直接Kmp求得next数组就ok了, 然后原创 2016-05-11 15:14:48 · 494 阅读 · 0 评论 -
poj 2406 Power Strings(kmp)
http://poj.org/problem?id=2406 Power Strings Description Given two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If w原创 2015-09-29 16:07:26 · 368 阅读 · 0 评论 -
LightOJ 1258 Making Huge Palindromes (回文&KMP)
http://acm.hust.edu.cn/vjudge/contest/view.action?cid=96545#problem/D Sample Input 4 bababababa pqrs madamimadam anncbaaababaaa Sample Output Case 1: 11 Case 2原创 2015-10-26 14:25:41 · 512 阅读 · 0 评论 -
hdu 3294 Girls' research(manacher)
http://acm.hdu.edu.cn/showproblem.php?pid=3294 Girls' research Problem Description One day, sailormoon girls are so delighted that they intend to research about palindromic strings. Operati原创 2015-10-04 14:00:09 · 319 阅读 · 0 评论 -
hdu 4513 吉哥系列故事——完美队形II(manacher)
http://acm.hdu.edu.cn/showproblem.php?pid=4513 吉哥系列故事——完美队形II Problem Description 吉哥又想出了一个新的完美队形游戏! 假设有n个人按顺序站在他的面前,他们的身高分别是h[1], h[2] ... h[n],吉哥希望从中挑出一些人,让这些人形成一个新的队形,新的队形若满足以下三点要求,则原创 2015-10-04 11:35:20 · 395 阅读 · 0 评论 -
poj 3974 Palindrome(manacher)
http://poj.org/problem?id=3974 Palindrome Description Andy the smart computer science student was attending an algorithms class when the professor asked the students a simple question, "Can原创 2015-10-04 10:39:37 · 442 阅读 · 0 评论 -
hdu 3613 Best Reward (manacher)
http://acm.hdu.edu.cn/showproblem.php?pid=3613 Best Reward Problem Description After an uphill battle, General Li won a great victory. Now the head of state decide to reward him with honor原创 2015-10-03 17:43:06 · 436 阅读 · 0 评论 -
hdu 3068 最长回文(manacher)
http://acm.hdu.edu.cn/showproblem.php?pid=3068 最长回文 Problem Description 给出一个只由小写英文字符a,b,c...y,z组成的字符串S,求S中最长回文串的长度. 回文就是正反读都是一样的字符串,如aba, abba等 Input 输入有多组case,不超过120组,每组输入为一行小写英文字符a原创 2015-10-03 14:43:27 · 402 阅读 · 0 评论 -
KMP 算法
字符串匹配的KMP算法 作者: 阮一峰 发布时间: 2013-08-28 17:12 阅读: 53977 次 推荐: 125 原文链接 [收藏] 字符串匹配是计算机的基本任务之一。 举例来说,有一个字符串"BBC ABCDAB ABCDABCDABDE",我想知道,里面是否包含另一个字符串"ABCDABD"? 许多算法可以完成这转载 2015-09-23 18:22:07 · 289 阅读 · 0 评论