后缀数组
say_c_box
小白不能不努力~
展开
-
SPOJ - DISUBSTR Distinct Substrings (后缀数组)
DISUBSTR - Distinct Substringsno tags Given a string, we need to find the total number of its distinct substrings.InputT- number of test cases. TEach test case consists of one st原创 2017-08-29 19:31:38 · 305 阅读 · 0 评论 -
POJ2406——Power Strings(后缀数组)
Power StringsTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 51218 Accepted: 21386DescriptionGiven two strings a and b we define a*b to be their conca原创 2017-08-29 20:16:48 · 540 阅读 · 0 评论 -
SPOJ - REPEATS Repeats (后缀数组)
REPEATS - Repeatsno tags A string s is called an (k,l)-repeat if s is obtained by concatenating k>=1 times some seed string t with length l>=1. For example, the string s = abaabaabaaba转载 2017-08-29 20:23:18 · 276 阅读 · 0 评论 -
POJ3693 Maximum repetition substring (后缀数组)
The repetition number of a string is defined as the maximum number R such that the string can be partitioned into R same consecutive substrings. For example, the repetition number of "ababab" is 3 and原创 2017-08-29 20:46:56 · 304 阅读 · 0 评论 -
POJ2774 Long Long Message(后缀数组)
Long Long MessageTime Limit: 4000MS Memory Limit: 131072KTotal Submissions: 31523 Accepted: 12719Case Time Limit: 1000MSDescriptionThe little cat is major原创 2017-08-29 20:52:37 · 296 阅读 · 0 评论 -
POJ3415 Common Substrings(后缀数组,单调栈)
Common SubstringsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 11195 Accepted: 3701DescriptionA substring of a string T is defined as:T(i, k)=原创 2017-08-29 21:26:51 · 316 阅读 · 0 评论 -
POJ3294——Life Forms 后缀数组
Life FormsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 15912 Accepted: 4695DescriptionYou may have wondered why most extraterrestrial life forms原创 2017-08-29 22:22:59 · 400 阅读 · 0 评论 -
Relevant Phrases of Annihilation SPOJ - PHRASES 后缀数组
PHRASES - Relevant Phrases of Annihilationno tags You are the King of Byteland. Your agents have just intercepted a batch of encrypted enemy messages concerning the date of the planned a原创 2017-08-29 22:41:47 · 367 阅读 · 0 评论