码迷,mamicode.com
首页 > 编程语言 > 详细

POJ3693Maximum repetition substring (后缀数组+RMQ)(占位)

时间:2017-12-10 15:16:36      阅读:25      评论:0      收藏:0      [点我收藏+]

标签:class   example   pre   hat   last   not   one   lang   begin   

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 "ababa" is 1.

Given a string containing lowercase letters, you are to find a substring of it with maximum repetition number.

Input

The input consists of multiple test cases. Each test case contains exactly one line, which
gives a non-empty string consisting of lowercase letters. The length of the string will not be greater than 100,000.

The last test case is followed by a line containing a ‘#‘.

Output

For each test case, print a line containing the test case number( beginning with 1) followed by the substring of maximum repetition number. If there are multiple substrings of maximum repetition number, print the lexicographically smallest one.

Sample Input

ccabababc
daabbccaa
#

Sample Output

Case 1: ababab
Case 2: aa

 

先占位,再慢慢想,ORZ。

 

POJ3693Maximum repetition substring (后缀数组+RMQ)(占位)

标签:class   example   pre   hat   last   not   one   lang   begin   

原文地址:http://www.cnblogs.com/hua-dong/p/8016916.html

(0)
(0)
   
举报
评论 一句话评论(0
0条  
登录后才能评论!
© 2014 mamicode.com 版权所有 京ICP备13008772号-2
迷上了代码!