KMP
Mason_xm
这个作者很懒,什么都没留下…
展开
-
Number Sequence (KMP)
HDU - 1711 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]...原创 2018-08-27 23:09:13 · 108 阅读 · 0 评论 -
剪花布条 (KMP)
HDU - 2087 题目:一块花布条,里面有些图案,另有一块直接可用的小饰条,里面也有一些图案。对于给定的花布条和小饰条,计算一下能从花布条中尽可能剪出几块小饰条来呢? Input输入中含有一些数据,分别是成对出现的花布条和小饰条,其布条都是用可见ASCII字符表示的,可见的ASCII字符有多少个,布条的花纹也有多少种花样。花纹条和小饰条不会超过1000个字符长。如果遇见#字符,...原创 2018-08-27 23:10:41 · 107 阅读 · 0 评论 -
Cyclic Nacklace (next数组)
HDU - 3746 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...原创 2018-08-27 23:08:49 · 85 阅读 · 0 评论 -
Power Strings (循环节问题)
POJ - 2406 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 we think of concatenation as multiplication, exponentiat...原创 2018-08-27 23:10:28 · 155 阅读 · 0 评论 -
Seek the Name, Seek the Fame
POJ - 2752 The little cat is so famous, that many couples tramp over hill and dale to Byteland, and asked the little cat to give names to their newly-born babies. They seek the name, and at the same...原创 2018-08-26 15:54:57 · 84 阅读 · 0 评论