![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM_字符串处理
文章平均质量分 88
77458
手敲仙盘键,目视星空棋,灵控比特力,逍遥虚空界。
展开
-
HDU - 4287 Intelligent IME 字典树
HDU - 4287Intelligent IMETime Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64uSubmit StatusDescription We all use cell phone today. And we原创 2015-08-07 20:12:47 · 1508 阅读 · 0 评论 -
UVA - 719Glass Beads(后缀数组)
DescriptionOnce upon a time there was a famous actress. As you may expect, she played mostly Antique Comedies most of all. All the people loved her. But she was not interested in the crowds. Her big ho原创 2016-09-29 21:18:38 · 613 阅读 · 0 评论 -
AC自动机练习解题题集
需要提前学习AC自动机的知识点:大牛的AC自动机详解HDU 2222 Keywords Search (传送门) 题意求目标串中出现了几种模式串 解题思路裸的AC AC自动机,使用一个标志模式串结尾的end end数组,查询一次,将相应的end end数组清零即可。 代码/*头文件模板*/#include <map>#include <set>#include <cmath>原创 2016-09-20 13:19:31 · 623 阅读 · 0 评论 -
Gym 100935F A Poet Computer (字典树)
F - A Poet ComputerTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice Gym 100935FDescriptionstandard input/outputStatements原创 2016-08-10 11:58:37 · 916 阅读 · 0 评论 -
SOJ 4438 Censor(KMP匹配)
C - CensorTime Limit:0MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionCensorfrog is now a editor to censor so-called sensitive words (敏感词).She原创 2016-08-17 18:22:53 · 950 阅读 · 0 评论 -
HDU 5763 Another Meaning 多校赛 (DP + KMP)
Another MeaningTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1111 Accepted Submission(s): 518Problem DescriptionAs is known原创 2016-08-01 21:08:50 · 545 阅读 · 0 评论 -
CodeForces 600A - Extract Numbers (模拟题)
A - Extract NumbersTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 600ADescriptionYou are given string s. Let's cal原创 2015-12-01 21:30:53 · 1158 阅读 · 0 评论 -
CodeForces 600C Make Palindrome (模拟题)
C - Make PalindromeTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 600CDescriptionA string is called palindrome if原创 2015-12-01 21:45:04 · 748 阅读 · 0 评论 -
HDU - 1247 Hat’s Words 字典树
HDU - 1247Hat’s WordsTime Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionA hat’s word is a word in the dictionary t原创 2015-08-07 19:54:34 · 1132 阅读 · 0 评论 -
HDU - 1711 Number Sequence KMP字符串匹配
HDU - 1711Number SequenceTime Limit: 5000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionGiven two sequences of numbers : a[1],原创 2015-08-06 22:02:41 · 858 阅读 · 0 评论 -
HDU - 1686 Oulipo KMP匹配运用
HDU - 1686OulipoTime Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionThe French author Georges Perec (1936�1982) onc原创 2015-08-07 00:14:13 · 1482 阅读 · 0 评论 -
HDU - 3460 Ancient Printer(字典树)
HDU - 3460Ancient PrinterTime Limit: 1000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionThe contest is beginning! While prepar原创 2015-08-09 11:25:37 · 1174 阅读 · 0 评论 -
Period UVALive - 3026(KMP)
Period(传送门) 题意给定字符串,找到每个前缀的最大循环节的个数,即循环周期,如果大于1的话就输出下标和周期数(循环节) 解题思路KMP就可以非常轻松的解决问题,首先提到一个next数组的性质,对于当前的前缀a[j],如果j % (j - next[j]) == 0则j - next[j]即为最小周期长度,而周期数就是j / (j - next[i]),至于为什么j - next[原创 2017-05-04 23:48:46 · 625 阅读 · 0 评论