KMP
阿里斯顿k
这个作者很懒,什么都没留下…
展开
-
Number Sequence (KMP)
Number SequenceGiven 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] =...原创 2018-08-19 10:47:14 · 213 阅读 · 0 评论 -
剪花布条 (KMP)
剪花布条一块花布条,里面有些图案,另有一块直接可用的小饰条,里面也有一些图案。对于给定的花布条和小饰条,计算一下能从花布条中尽可能剪出几块小饰条来呢? Input 输入中含有一些数据,分别是成对出现的花布条和小饰条,其布条都是用可见ASCII字符表示的,可见的ASCII字符有多少个,布条的花纹也有多少种花样。花纹条和小饰条不会超过1000个字符长。如果遇见#字符,则不再进行工作。...原创 2018-08-19 10:49:05 · 778 阅读 · 0 评论 -
A Secret()
A SecretTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 256000/256000 K (Java/Others)Total Submission(s): 2423 Accepted Submission(s): 892Proble...转载 2018-10-21 15:17:24 · 559 阅读 · 0 评论 -
Oulipo hdu1686
OulipoProblem DescriptionThe 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 avai...原创 2018-10-21 15:27:56 · 100 阅读 · 0 评论