![](https://img-blog.csdnimg.cn/20201014180756919.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
KMP
Splaying
Studying
展开
-
HDU4763(Theme Section)
Theme Section Problem Description It’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. To make the programs more interesting and challenging, the hosts are g原创 2020-07-24 17:55:58 · 86 阅读 · 0 评论 -
HDU4847(Wow! Such Doge!)
Wow! Such Doge! Problem Description Chen, Adrian (November 7, 2013). “Doge Is An Ac- tually Good Internet Meme. Wow.”. Gawker. Retrieved November 22, 2013.Doge is an Internet meme that became popular in 2013. The meme typically con- sists of a picture of a原创 2020-07-21 20:53:57 · 154 阅读 · 0 评论 -
HDU3374(String Problem)
String Problem Problem Description Give 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: String Rank SKYLONG 1 KYLONGS 2 YLONGSK 3 LONGSKY 4 ONGSKYL 5 NGSKY原创 2020-07-21 20:12:47 · 65 阅读 · 0 评论 -
HDU2609(How many)
How many Problem Description Give you n ( n < 10000) necklaces ,the length of necklace will not large than 100,tell me How many kinds of necklaces total have.(if two necklaces can equal by rotating ,we say the two necklaces are some). For example 0110 e原创 2020-07-21 17:37:10 · 73 阅读 · 0 评论 -
HDU1238(Substrings)
Substrings Problem Description You are given a number of case-sensitive strings of alphabetic characters, find the largest string X, such that either X, or its inverse can be found as a substring of any of the given strings. Input The first line of the inp原创 2020-06-18 13:27:28 · 130 阅读 · 0 评论 -
POJ2406(Power Strings)
Power Strings Description Given 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 multiplication, exponentiation by a non-negative integer is defined in t原创 2020-06-18 11:44:32 · 101 阅读 · 0 评论 -
POJ3080(Blue Jeans)
Blue Jeans Description The Genographic Project is a research partnership between IBM and The National Geographic Society that is analyzing DNA from hundreds of thousands of contributors to map how the Earth was populated. As an IBM researcher, you have bee原创 2020-06-16 18:36:58 · 144 阅读 · 0 评论 -
HDU2328(Corporate Identity)
Corporate Identity Problem Description Beside other services, ACM helps companies to clearly state their “corporate identity”, which includes company logo but also other signs, like trademarks. One of such companies is Internet Building Masters (IBM), whic原创 2020-06-16 18:30:43 · 77 阅读 · 0 评论 -
POJ2752(Seek the Name, Seek the Fame)
Seek the Name, Seek the Fame Description 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 fame. In orde原创 2020-06-16 10:59:56 · 91 阅读 · 0 评论 -
HDU1358(Period)
Period Problem Description 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 <= i <= N) we want to k原创 2020-06-15 15:09:56 · 88 阅读 · 0 评论 -
HDU3764(Cyclic Nacklace)
Cyclic Nacklace Problem Description 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 tide over the last原创 2020-06-14 23:39:59 · 144 阅读 · 0 评论 -
HDU2594(Simpsons’ Hidden Talents)
Simpsons’ Hidden Talents Problem Description Homer: 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 example. I want to find out if I have a talent in politics, OK? Marge:原创 2020-06-14 23:24:31 · 102 阅读 · 0 评论 -
HDU1686(Oulipo)
Oulipo Problem Description 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’affirmait faux. Tout avait Fai原创 2020-06-14 23:15:45 · 125 阅读 · 0 评论 -
HDU1711(Number Sequence)
Number Sequence Problem Description 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] = b[1], a[K + 1] = b[2], … , a[K + M - 1]原创 2020-06-13 23:32:10 · 102 阅读 · 0 评论 -
HDU2087(剪花布条)
剪花布条 Problem Description 一块花布条,里面有些图案,另有一块直接可用的小饰条,里面也有一些图案。对于给定的花布条和小饰条,计算一下能从花布条中尽可能剪出几块小饰条来呢? Input 输入中含有一些数据,分别是成对出现的花布条和小饰条,其布条都是用可见ASCII字符表示的,可见的ASCII字符有多少个,布条的花纹也有多少种花样。花纹条和小饰条不会超过1000个字符长。如果遇见#字符,则不再进行工作。 Output 输出能从花纹布中剪出的最多小饰条个数,如果一块都没有,那就老老实实输出0原创 2020-06-13 22:48:31 · 110 阅读 · 0 评论 -
HDU2203(亲和串)
亲和串 Problem Description 人随着岁数的增长是越大越聪明还是越大越笨,这是一个值得全世界科学家思考的问题,同样的问题Eddy也一直在思考,因为他在很小的时候就知道亲和串如何判断了,但是发现,现在长大了却不知道怎么去判断亲和串了,于是他只好又再一次来请教聪明且乐于助人的你来解决这个问题。 亲和串的定义是这样的:给定两个字符串s1和s2,如果能通过s1循环移位,使s2包含在s1中,那么我们就说s2 是s1的亲和串。 Input 本题有多组测试数据,每组数据的第一行包含输入字符串s1,第二行包原创 2020-06-13 22:43:41 · 216 阅读 · 0 评论