
字符串
文章平均质量分 76
小坏蛋_千千
im0qianqian_站在回忆的河边看着摇晃的渡船终年无声地摆渡,它们就这样安静地画下黄昏画下清晨......
展开
-
HDU 3746:Cyclic Nacklace
题意:给出一个字符串,问再加多少个同样序列可以构成至少里面存在两个相同的串,加的字符在原串左边右边都可以。如:abca 加ab得到abcabc,成立abcde加abcde得到abcdeabcde成立原创 2016-04-29 21:39:43 · 640 阅读 · 0 评论 -
HDU 6194 string string string (SAM)
Description Uncle Mao is a wonderful ACMER. One day he met an easy problem, but Uncle Mao was so lazy that he left the problem to you. I hope you can give him a solution. Given a string s, we de原创 2017-09-22 07:33:32 · 630 阅读 · 0 评论 -
HDU 4641 K-string (SAM)
Description Given a string S. K-string is the sub-string of S and it appear in the S at least K times.It means there are at least K different pairs (i,j) so that Si,Si+1… Sj equal to this K-string. G原创 2017-09-21 18:20:15 · 632 阅读 · 0 评论 -
HDU 6208 The Dominator of Strings (SAM)
Description Here you have a set of strings. A dominator is a string of the set dominating all strings else. The string S is dominated by T if S is a substring of T. Input The input contains severa原创 2017-09-21 08:58:26 · 269 阅读 · 0 评论 -
HDU 5769 Substring (后缀数组)
Description ?? is practicing his program skill, and now he is given a string, he has to calculate the total number of its distinct substrings. But ?? thinks that is too easy, he wants to make th原创 2017-09-14 07:43:01 · 331 阅读 · 0 评论 -
SPOJ SUBST1 - New Distinct Substrings (后缀数组)
Description Given a string, we need to find the total number of its distinct substrings. Input T - number of test cases. T<=20; Each test case consists of one string, whose length is <= 50000 Out原创 2017-09-13 21:26:54 · 431 阅读 · 0 评论 -
Codeforces 852 G. Bathroom terminal(trie)
Description Smith wakes up at the side of a dirty, disused bathroom, his ankle chained to pipes. Next to him is tape-player with a hand-written message “Play Me”. He finds a tape in his own back pock原创 2017-09-05 17:35:04 · 514 阅读 · 0 评论 -
HDU 6153 A Secret (扩展KMP)
Description Today is the birthday of SF,so VS gives two strings S1,S2 to SF as a present,which have a big secret.SF is interested in this secret and ask VS how to get it.There are the things that VS原创 2017-08-20 09:31:20 · 363 阅读 · 0 评论 -
HDU 4622 Reincarnation (区间不相同子串个数:字符串哈希 | 后缀数组 | 后缀自动机)
Problem Description Now you are back,and have a task to do: Given you a string s consist of lower-case English letters only,denote f(s) as the number of distinct sub-string of s. And you ha原创 2017-05-03 17:16:21 · 1971 阅读 · 1 评论 -
HDU 4333 Revolving Digits (扩展KMP)
Problem Description One day Silence is interested in revolving the digits of a positive integer. In the revolving operation, he can put several last digits to the front of the integer. Of course, he原创 2017-05-03 16:04:13 · 558 阅读 · 0 评论 -
山东省第七届ACM省赛------Reversed Words
Reversed WordsTime Limit: 2000MS Memory limit: 131072K题目描述Some aliens are learning English. They have a very strange way in writing that they revered every word in the sentence but keep原创 2016-06-12 21:30:11 · 948 阅读 · 0 评论 -
HDU 5842:Lweb and String (统计)
Lweb and StringTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 261 Accepted Submission(s): 174Problem DescriptionLweb has a s原创 2016-08-15 10:00:58 · 522 阅读 · 0 评论 -
SDUT 2413:n a^o7 !
n a^o7 !Time Limit: 1000MS Memory limit: 65536K题目描述 All brave and intelligent fighters, next you will step into a distinctive battleground which is full of sweet and happiness. If you原创 2016-04-30 21:31:32 · 713 阅读 · 0 评论 -
POJ 2406:Power Strings
Power StringsTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 41252 Accepted: 17152DescriptionGiven two strings a and b we define a*b to be their concate原创 2016-04-19 21:04:03 · 561 阅读 · 0 评论 -
Codeforces 868 D. Huge Strings (二分+随机+SAM)
Description You are given n strings s1, s2, …, sn consisting of characters 0 and 1. m operations are performed, on each of them you concatenate two existing strings into a new one. On the i-th operat原创 2017-10-06 10:05:50 · 825 阅读 · 0 评论