KMP
baodream
这个作者很懒,什么都没留下…
展开
-
HDU 3746 Cyclic Nacklace(KMP求循环节)
题目链接:http://hdu.hustoj.com/showproblem.php?pid=3746Problem DescriptionCC always becomes very depressed at the end of this month, he has checked his credit card yesterday, without any surprise, there a...原创 2018-04-07 22:32:41 · 167 阅读 · 0 评论 -
HDU 1711 Number Sequence
题目链接: http://hdu.hustoj.com/showproblem.php?pid=1711Problem DescriptionGiven two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 <= M <= 10000, 1 <= N <=...原创 2018-04-04 10:51:34 · 105 阅读 · 0 评论 -
HDU 1876 A + B for you again(KMP)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1867Problem DescriptionGenerally speaking, there are a lot of problems about strings processing. Now you encounter another such problem. If you get two s...原创 2018-04-15 19:13:21 · 252 阅读 · 0 评论 -
HDU 3336 Count the string
题目链接:http://hdu.hustoj.com/showproblem.php?pid=3336Problem 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 ...原创 2018-04-15 17:36:22 · 151 阅读 · 0 评论 -
POJ 3080 Blue Jeans(暴力,KMP)
题目链接:http://poj.org/problem?id=3080DescriptionThe Genographic Project is a research partnership between IBM and The National Geographic Society that is analyzing DNA from hundreds of thousands of cont...原创 2018-04-09 21:04:01 · 131 阅读 · 0 评论 -
HDU 2594 Simpsons’ Hidden Talents
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2594 Problem 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?Ho...原创 2018-04-14 19:57:40 · 154 阅读 · 0 评论 -
E Youhane Assembler(“景驰科技杯”2018年华南理工大学程序设计竞赛)
题目链接:https://www.nowcoder.com/acm/contest/94/E题目大意:给定n个字符串,编号1-n,q次询问,每次询问一个了l,r,求r号字符串的前缀和l号的后缀匹配最大程度思路1:因为给定字符串只有ATCG四个字母,我们在r和l字符串中间加任意一个其他字符,通过KMP的Get_next即可求出,即Next[len]即为最后答案,因为中间添加了其他字符,所以l的后缀肯...原创 2018-04-08 21:11:16 · 319 阅读 · 0 评论 -
POJ 2752 Seek the Name, Seek the Fame(KMP的Next数组应用)
题目链接:http://poj.org/problem?id=2752DescriptionThe 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. Th...原创 2018-04-08 20:38:46 · 125 阅读 · 0 评论 -
POJ 2406 Power Strings(KMP循环节问题)
题目链接:http://poj.org/problem?id=2406DescriptionGiven 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 concatenati...原创 2018-04-08 17:53:51 · 222 阅读 · 0 评论 -
POj 3461 Oulipo ,HDU 1686 Oulipo(KMP)
题目链接:http://poj.org/problem?id=3461题目链接:http://hdu.hustoj.com/showproblem.php?pid=1686Problem DescriptionThe French author Georges Perec (1936–1982) once wrote a book, La disparition, without the lett...原创 2018-03-31 21:17:03 · 171 阅读 · 0 评论 -
HDU 1358 Period (KMP的Next数组应用,循环节问题)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1358Problem 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...原创 2018-04-08 17:23:35 · 257 阅读 · 0 评论 -
HDU 2087 剪花布条
题目链接:http://hdu.hustoj.com/showproblem.php?pid=2087Problem Description一块花布条,里面有些图案,另有一块直接可用的小饰条,里面也有一些图案。对于给定的花布条和小饰条,计算一下能从花布条中尽可能剪出几块小饰条来呢? Input输入中含有一些数据,分别是成对出现的花布条和小饰条,其布条都是用可见ASCII字符表示的,可见的ASCII...原创 2018-04-04 10:54:58 · 153 阅读 · 0 评论