KMP
Top_Spirit
我的指针已经找了他的对象,而我呢?
展开
-
HUST 1010 (KMP的Next数组应用)
There is a string A. The length of A is less than 1,000,000. I rewrite it again and again. Then I got a new string: AAAAAA...... Now I cut it from two different position and get a new string B. Then, ...原创 2018-05-10 18:53:15 · 190 阅读 · 0 评论 -
Count the string HDU - 3336 (KMP)
t 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 prefixes of this string. For example: s: "abab...原创 2019-01-22 09:25:58 · 230 阅读 · 0 评论 -
Substrings HDU - 1238 (KMP+暴力枚举)
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. Inp...原创 2019-01-22 11:24:24 · 344 阅读 · 0 评论 -
Codeforces D. Common Divisors KMP
D. Common Divisorstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya has recently learned at school what a number's divisor ...原创 2019-01-16 16:12:16 · 210 阅读 · 0 评论 -
Corporate Identity HDU - 2328 (KMP)
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 M...原创 2019-01-22 13:09:39 · 212 阅读 · 0 评论 -
拓展KMP
拓展kmp是对KMP算法的扩展,它解决如下问题:定义母串S,和字串T,设S的长度为n,T的长度为m,求T与S的每一个后缀的最长公共前缀,也就是说,设extend数组,extend[i]表示T与S[i,n-1]的最长公共前缀,要求出所有extend[i](0<=i<n)。注意到,如果有一个位置extend[i]=m,则表示T在S中出现,而且是在位置i出现,这就是标准的KMP问题,...转载 2019-01-16 18:40:42 · 108 阅读 · 0 评论 -
Codeforces B. Password (KMP)
B. Passwordtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAsterix, Obelix and their temporary buddies Suffix and Prefix has fi...原创 2019-01-16 20:16:21 · 351 阅读 · 0 评论 -
String Problem HDU - 3374 (KMP+最小表示法)
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...原创 2019-01-22 19:52:36 · 190 阅读 · 0 评论 -
Making Huge Palindromes LightOJ - 1258 (Manacher || KMP )
A string is said to be a palindrome if it remains same when read backwards. So, 'abba', 'madam' both are palindromes, but 'adam' is not.Now you are given a non-empty stringS, containing only lower...原创 2019-04-25 08:15:35 · 185 阅读 · 0 评论 -
Simpsons’ Hidden Talents HDU - 2594 (KMP)
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 politic...原创 2019-01-21 20:16:48 · 145 阅读 · 0 评论 -
Oulipo HDU 1686 (哈希或KMP)
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...原创 2019-01-16 10:45:41 · 166 阅读 · 0 评论 -
Blue Jeans POJ - 3080 (KMP 暴力枚举)
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. ...原创 2019-01-21 19:23:52 · 207 阅读 · 0 评论 -
Power Strings POJ - 2406 (KMP找循环节)
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, exponentiation by a non...原创 2019-01-20 15:44:00 · 133 阅读 · 0 评论 -
Number Sequence HDU - 1711 (KMP)
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...原创 2019-01-21 10:52:17 · 112 阅读 · 0 评论 -
剪花布条 HDU - 2087 (KMP)
一块花布条,里面有些图案,另有一块直接可用的小饰条,里面也有一些图案。对于给定的花布条和小饰条,计算一下能从花布条中尽可能剪出几块小饰条来呢? Input输入中含有一些数据,分别是成对出现的花布条和小饰条,其布条都是用可见ASCII字符表示的,可见的ASCII字符有多少个,布条的花纹也有多少种花样。花纹条和小饰条不会超过1000个字符长。如果遇见#字符,则不再进行工作。 Output...原创 2019-01-21 11:03:02 · 129 阅读 · 0 评论 -
Cyclic Nacklace HDU - 3746 (KMP)
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 t...原创 2019-01-21 13:26:35 · 124 阅读 · 0 评论 -
A Needle in the Haystack SPOJ - NHAY
Write a program that finds all occurences of a given pattern in a given input string. This is often referred to as finding a needle in a haystack.The program has to detect all occurences of the nee...原创 2019-01-15 20:15:19 · 438 阅读 · 0 评论 -
Period HDU - 1358(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...原创 2019-01-21 14:30:42 · 148 阅读 · 0 评论 -
Seek the Name, Seek the Fame POJ - 2752 (KMP)
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 t...原创 2019-01-21 15:14:31 · 103 阅读 · 0 评论 -
Extend to Palindrome SPOJ - EPALIN 哈希或KMP
Your task is, given an integer N, to make a palindrome (word that reads the same when you reverse it) of length at least N (1 <= N <= 100,000). Any palindrome will do.Easy, isn't it? That's w...原创 2019-01-16 09:43:12 · 325 阅读 · 2 评论 -
CodeforcesB. Camp Schedule (KMP)
B. Camp Scheduletime limit per test1 secondmemory limit per test512 megabytesinputstandard inputoutputstandard outputThe new camp by widely-known over the country Spring Programming...原创 2019-04-15 09:00:44 · 300 阅读 · 0 评论