HDU 1358 kmp找周期子串

Period

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

  HDU 1358

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 A  ^K , 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

     
     

      
      3
aaa
12
aabaabaabaab
0 
     
     

 

Sample Output

     
     

      
      Test case #1
2 2
3 3

Test case #2
2 2
6 2
9 3
12 4 
     
     

 

找周期子串方法：

if(i%(i-next[i])==0) //串长为i，周期为i/(i-nex[i])具体原因可以自己推一下，利用了next[]的性质。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
using namespace std;
int nex[1000005];
int k=0;
void pre(string str){
    nex[0]=-1;
    int i=0,j=-1;
    while(i<str.size()){
        if(j==-1||str[i]==str[j]){
            j++;i++;
            nex[i]=j;
        }else
            j=nex[j];
    }
}
void kmp(string str){
    pre(str);
    int len=str.size();
    cout<<"Test case #"<<++k<<endl;
    for(int i=2;i<=len;i++)
        if(i%(i-nex[i])==0&&i/(i-nex[i])>1)
            cout<<i<<' '<<i/(i-nex[i])<<endl;
    cout<<endl;

}
int main()
{
    std::cout.sync_with_stdio(false);
    string str;
    int n;
    while(cin>>n&&n){
        cin>>str;
        kmp(str);

    }
}