Period + KMP
来源:互联网 发布:三维软件培训机构 编辑:程序博客网 时间:2024/05/17 09:45
Period
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 25 Accepted Submission(s) : 9
Problem Description
For each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic string. That is, for each i (2 <= i <= N) we want to know the largest K > 1 (if there is one) such that the prefix of S with length i can be written as AK , that is A concatenated K times, for some string A. Of course, we also want to know the period K.
Input
The input file consists of several test cases. Each test case consists of two lines. The first one contains N (2 <= N <= 1 000 000) – the size of the string S. The second line contains the string S. The input file ends with a line, having the number zero on it.
Output
For each test case, output “Test case #” and the consecutive test case number on a single line; then, for each prefix with length i that has a period K > 1, output the prefix size i and the period K separated by a single space; the prefix sizes must be in increasing order. Print a blank line after each test case.
Sample Input
3aaa12aabaabaabaab0
Sample Output
Test case #12 23 3Test case #22 26 29 312 4/*求一个字符串的最大重复字串*/#include<iostream>using namespace std ;#define MAX 1000005 int next[MAX] ;char a[MAX] ;void pre_next(int k ){int i = 0 , j = -1 ;next[0] = - 1 ;while( i < k ){if( j == -1 || a[i] == a[j]){i++ ;j++ ;next[i] = j ;}elsej = next[j] ;}}int main(void){int n , count = 1 ;while (cin >> n && n ){cout<<"Test case #"<<count ++<< endl ;getchar();gets(a);int len= strlen(a) ;pre_next(len) ;for(int i = 2 ; i <= n ; i ++){int j = i - next[i] ;if(i % j == 0 && i / j > 1 ) cout<<i<<" "<< i / j <<endl ; }cout<<endl ;}return 0 ; }
- Period + KMP
- Period [KMP]
- period kmp
- Period kmp
- 1961 Period //KMP
- HDU 1358 Period (KMP)
- poj 1961:Period (KMP)
- zoj 2177 Period (KMP )
- (KMP)Period(H1358)
- 【KMP】 poj1961 Period
- poj1961 Period----KMP
- poj 1961 Period (KMP)
- Period hdu1358 KMP
- Period 1358 KMP
- poj 1961 Period---kmp
- Poj 1960 Period//kmp
- HDU 1358 Period KMP
- POJ 1961-Period:KMP
- linux uncompress
- c#中的有用的方法
- “微笑妹妹”9岁撑起一个家
- poj 1469 && hdu1083 COURSES
- 一个老兵妻子的绝境
- Period + KMP
- 一个简易的登陆框html(table)+css
- 最大长方形 (Maximum Submatrix & Largest Rectangle)
- 深入浅出C/C++中的正则表达式库(一)——GNU Regex Library
- linux上gvim的configuration
- 实现Collections.sort方法
- Makefile 写法整理
- 浅谈垃圾食品
- 【jiasuba】photoshop制图的常用工具和技巧