随笔分类 - 后缀数组
摘要:Maximum repetition substring Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10461 Accepted: 3234 Description The repetition number of a st
阅读全文
摘要:REPEATS - Repeats no tags no 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>=
阅读全文
摘要:1297. Palindrome Time limit: 1.0 second Memory limit: 64 MB The “U.S. Robots” HQ has just received a rather alarming anonymous letter. It states that
阅读全文
摘要:string string string Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 608 Accepted Submission(s):
阅读全文
摘要:DISUBSTR - Distinct Substrings no tags no tags Given a string, we need to find the total number of its distinct substrings. Input T- number of test ca
阅读全文
摘要:Musical Theme Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 30430 Accepted: 10183 Description A musical melody is represented as a sequen
阅读全文

浙公网安备 33010602011771号