摘要：
后缀数组： sa[i]:表示排名第i个的首字母位置 Rank[i]:第i个数的排名 Height[i]:sa[i]和sa[i-1]的最长公共前缀 suffix(j) 和suffix(k) 的最长公共前缀为height[rank[j]+1], height[rank[j]+2], height[ran 阅读全文
摘要：
Power Strings Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 41110 Accepted: 17099 Description Given two strings a and b we define a*b to 阅读全文
摘要：
Maximum repetition substring Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 8669 Accepted: 2637 Description The repetition number of a str 阅读全文
摘要：
Description You are the King of Byteland. Your agents have just intercepted a batch of encrypted enemy messages concerning the date of the planned att 阅读全文
摘要：
Life Forms Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 12484 Accepted: 3502 Description You may have wondered why most extraterrestrial 阅读全文
摘要：
Common Substrings Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 9248 Accepted: 3071 Description A substring of a string T is defined as: 阅读全文
摘要：
Long Long Message Time Limit: 4000MS Memory Limit: 131072K Total Submissions: 25752 Accepted: 10483 Case Time Limit: 1000MS Description The little cat 阅读全文
摘要：
1297. Palindrome Time limit: 1.0 secondMemory limit: 64 MB The “U.S. Robots” HQ has just received a rather alarming anonymous letter. It states that t 阅读全文
摘要：
694. Distinct Substrings Problem code: DISUBSTR Given a string, we need to find the total number of its distinct substrings. Input T- number of test c 阅读全文
摘要：
Milk Patterns Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 13127 Accepted: 5842 Case Time Limit: 2000MS Description Farmer John has noti 阅读全文