Kmp
文章平均质量分 67
vocaloid01
小菜鸟一只_(:з」∠)_前来膜拜各路大佬orz
展开
-
Seek the Name, Seek the Fame
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 time seek the原创 2018-01-31 21:41:18 · 136 阅读 · 0 评论 -
HDU1358——Period(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 <原创 2018-01-30 21:58:08 · 303 阅读 · 0 评论 -
HDU3746——Cyclic Nacklace(Next数组求最小循环节)
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原创 2018-01-30 17:17:12 · 258 阅读 · 0 评论 -
HDU1711 ——Number Sequence(KMP模板题)
Given two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 &lt;= M &lt;= 10000, 1 &lt;= N &lt;= 1000000). Your task is to find a number K which make a[K] = b[1], a[K + 1] = b[2],原创 2017-12-04 19:32:02 · 221 阅读 · 0 评论 -
HDU - 5918 Sequence I(2016年长春区域赛铜牌题)
Mr. Frog has two sequences a1,a2,⋯,an and b1,b2,⋯,bm and a number p. He wants to know the number of positions q such that sequence b1,b2,⋯,bm is exactly the sequence aq,aq+p,aq+2p,⋯,aq+(m−1)p where q+...原创 2018-07-22 15:09:58 · 212 阅读 · 0 评论 -
hdu 1686 Oulipo(求文本串中有多少个模式串)
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’a...原创 2019-02-28 12:55:26 · 246 阅读 · 0 评论 -
hdu 1867 A + B for you again(KMP灵活应用)
Generally speaking, there are a lot of problems about strings processing. Now you encounter another such problem. If you get two strings, such as “asdf” and “sdfg”, the result of the addition between ...原创 2019-02-28 18:14:50 · 200 阅读 · 0 评论