hdu 1358 Period(KMP入门题)

Period

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 4485    Accepted Submission(s): 2163

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 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

 

 

这道KMP入门，主要在于加深next函数的理解，即与自身的匹配。

#include<iostream>
#include<vector>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <math.h>
#include<algorithm>
#define ll long long
#define eps 1e-8
using namespace std;

int nexts[1000050];
char str[1000050];

void pre_nexts(int n)//next函数
{
    memset(nexts,0,sizeof(nexts));
    int j = 0,k = -1;
    nexts[0] = -1;
    while(str[j])
    {
        if(k == -1 || str[j] == str[k])  nexts[++j] = ++k;//与自身的子串匹配
        else k = nexts[k];//匹配失败，返回
    }
}
void KMP()
{
    int i,t;
    for(i = 2; str[i-1]; i++)
    {
        t = i - nexts[i];//子串长度
        if(i % t == 0 && i / t > 1) printf("%d %d
",i,i/t);//如果当前位置为一个循环节，則输出
    }
}
int main(void)
{
    int n,cnt = 1;
    while(scanf("%d",&n),n)
    {
        scanf("%s",str);
        pre_nexts(n);
        printf("Test case #%d
",cnt++);
        KMP();
        printf("
");
    }
    return 0;
}