字符串
文章平均质量分 87
Twillz
这个作者很懒,什么都没留下…
展开
-
HDU 1711 Number Sequence (KMP模板)
Given two sequences of numbers : a[1], a[2], …… , a[N], and b[1], b[2], …… , b[M] (1 <= M <= 10000, 1 <= N <= 1000000). Your task is to find a number K which make a[K] = b[1], a[K + 1] = b[2], …… , a[K原创 2017-08-22 15:25:17 · 209 阅读 · 0 评论 -
HDU 1686 Oulipo (KMP查找可交叉区间模式串)
The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter ‘e’. He was a member of the Oulipo group. A quote from the book: Tout avait Pair normal, mais tout s’af原创 2017-08-22 15:28:52 · 256 阅读 · 0 评论 -
HDU 2087 剪花布条(KMP查找不交叉区间的模式串个数)
一块花布条,里面有些图案,另有一块直接可用的小饰条,里面也有一些图案。对于给定的花布条和小饰条,计算一下能从花布条中尽可能剪出几块小饰条来呢? Input 输入中含有一些数据,分别是成对出现的花布条和小饰条,其布条都是用可见ASCII字符表示的,可见的ASCII字符有多少个,布条的花纹也有多少种花样。花纹条和小饰条不会超过1000个字符长。如果遇见#字符,则不再进行工作。 Output原创 2017-08-22 15:30:45 · 233 阅读 · 0 评论 -
HDU 3746 Cyclic Nacklace (KMP和循环节)
CC 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 thinking about how to原创 2017-08-22 15:38:30 · 348 阅读 · 0 评论 -
HDU 1358 Peroid(KMP和循环节)
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 whether the prefix is a periodic string. That is, for each i (2 <原创 2017-08-22 15:43:30 · 404 阅读 · 0 评论 -
HDU 3336 Count the strings(KMP+DP)
It is well known that AekdyCoin is good at string problems as well as number theory problems. When given a string s, we can write down all the non-empty prefixes of this string. For example: s: “abab原创 2017-08-22 23:11:11 · 255 阅读 · 0 评论 -
HDU 5536(01字典树)
John is a manager of a CPU chip factory, the factory produces lots of chips everyday. To manage large amounts of products, every processor has a serial number. More specifically, the factory produces n原创 2017-08-23 00:00:29 · 340 阅读 · 0 评论 -
Watto and Mechanism(字符串hash算法)
Watto, the owner of a spare parts store, has recently got an order for the mechanism that can process strings in a certain way. Initially the memory of the mechanism is filled with n strings. Then the原创 2017-08-16 00:51:43 · 728 阅读 · 0 评论