KMP
无
旺 崽
这个作者很懒,什么都没留下…
展开
-
牛客小白月赛28 G.牛牛和字符串的日常
牛客小白月赛28 G.牛牛和字符串的日常题目链接题目描述牛牛每天都要做的事就是读书,从书里找自己喜欢的句子,他每天都会去读一本书,如果牛牛今天读的书的某连续 kkk 个字符刚好是牛牛喜欢句子的某个前缀,那么牛牛将得到{}kk点兴奋感,但他每天只能注意到一次自己喜欢的句子(也就是每天只能增加一次兴奋感),也就是说他会尽量去找那个让自己兴奋度增加最多的句子,那么,nnn 天之后牛牛总共最多能有多少兴奋感?输入描述:第一行是一个字符串 s(∣s∣<=1×105)s(|s|<=1×10^5)s原创 2020-09-23 15:18:09 · 2611 阅读 · 0 评论 -
HHUOJ 1634 算法4-6:KMP字符串模式匹配算法实现
HDUOJ 1634 算法4-6:KMP字符串模式匹配算法实现题目链接题目描述KMP算法是字符串模式匹配算法中较为高效的算法之一,其在某次子串匹配母串失败时并未回溯母串的指针而是将子串的指针移动到相应的位置。严蔚敏老师的书中详细描述了KMP算法,同时前面的例子中也描述了子串移动位置的数组实现的算法。前面你已经实现了子串移动的数组,现在就来利用该数组来实现KMP模式匹配。输入3组字符串,每组字符串占一行。每行包含由空格分隔的两个字符串,字符串仅由英文小写字母组成且长度不大于100。输出每组数据输原创 2020-08-24 15:47:19 · 2881 阅读 · 0 评论 -
HHUOJ 1633 算法4-7:KMP算法中的模式串移动数组
HDUOJ 1633 算法4-7:KMP算法中的模式串移动数组题目链接题目描述字符串的子串定位称为模式匹配,模式匹配可以有多种方法。简单的算法可以使用两重嵌套循环,时间复杂度为母串与子串长度的乘积。而KMP算法相对来说在时间复杂度上要好得多,为母串与子串长度的和。但其算符比较难以理解。在KMP算法中,使用到了一个next数组。这个数组就是在比较失配时母串指针不必回溯,而子串指针移动相应位置即可。我们给出书中next数组的算式表示以及算法,请你实现之。输入一个模式串,仅由英文小写字母组成。长度不大原创 2020-08-24 15:27:35 · 2679 阅读 · 0 评论 -
The Preliminary Contest for ICPC China Nanchang National Invitational M. Subsequence
The Preliminary Contest for ICPC China Nanchang National Invitational M. Subsequence题目链接Give a string S and N string TiT_iTi , determine whether TiT_iTi is a subsequence of S.If ti is subsequence of S, print YES,else print NO.If there is an array {K1原创 2020-06-27 17:16:39 · 2317 阅读 · 0 评论 -
牛客 13253 子串
牛客 13253 子串题目链接题目描述给出一个正整数n,我们把1…n在k进制下的表示连起来记为s(n,k),例如s(16,16)=123456789ABCDEF10, s(5,2)=11011100101。现在对于给定的n和字符串t,我们想知道是否存在一个k(2 ≤ k ≤ 16),使得t是s(n,k)的子串。输入描述:第一行一个整数n(1 ≤ n ≤ 50,000)。第二行一个字符串...原创 2020-04-09 19:43:10 · 2500 阅读 · 0 评论 -
HDUOJ 4763 Theme Section
HDUOJ 4763 Theme Section题目链接Problem DescriptionIt’s time for music! A lot of popular musicians are invited to join us in the music festival. Each of them will play one of their representative songs...原创 2020-04-03 15:52:18 · 2240 阅读 · 0 评论 -
FZUOJ 1901 Period II
FZUOJ 1901 Period IIFor each prefix with length P of a given string S,ifS[i]=S[i+P] for i in [0…SIZE(S)-p-1],then the prefix is a “period” of S. We want to all the periodic prefixs.InputInput con...原创 2020-03-31 18:21:26 · 2246 阅读 · 0 评论 -
HDUOJ 3374 String Problem
HDUOJ 3374 String ProblemProblem DescriptionGive you a string with length N, you can generate N strings by left shifts. For example let consider the string “SKYLONG”, we can generate seven strings:...原创 2020-03-31 15:11:28 · 2167 阅读 · 0 评论 -
POJ 3450 Corporate Identity
POJ 3450 Corporate IdentityDescriptionBeside other services, ACM helps companies to clearly state their “corporate identity”, which includes company logo but also other signs, like trademarks. One o...原创 2020-03-31 11:05:06 · 2188 阅读 · 0 评论 -
HDUOJ 3336 Count the string
HDUOJ 3336 Count the stringProblem DescriptionIt 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...原创 2020-03-27 16:08:09 · 2143 阅读 · 0 评论 -
HDUOJ 2594 Simpsons’ Hidden Talents
HDUOJ 2594 Simpsons’ Hidden TalentsProblem DescriptionHomer: Marge, I just figured out a way to discover some of the talents we weren’t aware we had.Marge: Yeah, what is it?Homer: Take me for exam...原创 2020-03-27 10:19:16 · 2168 阅读 · 0 评论 -
POJ 3080 Blue Jeans
POJ 3080 Blue JeansDescriptionThe Genographic Project is a research partnership between IBM and The National Geographic Society that is analyzing DNA from hundreds of thousands of contributors to ma...原创 2020-03-26 11:59:37 · 2265 阅读 · 0 评论 -
POJ 2752 Seek the Name, Seek the Fame
POJ 2752 Seek the Name, Seek the FameDescriptionThe 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...原创 2020-03-21 15:42:20 · 2268 阅读 · 0 评论 -
HDUOJ 1358 Period
HDUOJ 1358 PeriodProblem DescriptionFor 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 pe...原创 2020-03-20 09:58:07 · 2116 阅读 · 0 评论 -
POJ 2406 Power Strings
POJ 2406 Power StringsDescriptionGiven two strings a and b we define ab to be their concatenation. For example, if a = “abc” and b = “def” then ab = “abcdef”. If we think of concatenation as multipl...原创 2020-03-19 17:32:18 · 2249 阅读 · 0 评论 -
HDUOJ 3746 Cyclic Nacklace
HDUOJ 3746 Cyclic NacklaceProblem DescriptionCC 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....原创 2020-03-18 15:03:09 · 2211 阅读 · 0 评论 -
HDUOJ 2087 剪花布条
HDUOJ 2087 剪花布条Problem Description一块花布条,里面有些图案,另有一块直接可用的小饰条,里面也有一些图案。对于给定的花布条和小饰条,计算一下能从花布条中尽可能剪出几块小饰条来呢?Input输入中含有一些数据,分别是成对出现的花布条和小饰条,其布条都是用可见ASCII字符表示的,可见的ASCII字符有多少个,布条的花纹也有多少种花样。花纹条和小饰条不会超过10...原创 2020-03-16 15:38:23 · 2156 阅读 · 0 评论 -
POJ 3461 Oulipo
POJ 3461 OulipoDescriptionThe 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...原创 2020-03-16 09:13:44 · 2155 阅读 · 0 评论 -
HDUOJ 1711 Number Sequence
HDUOJ 1711 Number SequenceProblem DescriptionGiven 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 ...原创 2020-03-13 16:32:52 · 2198 阅读 · 0 评论