Period [KMP]

题目描述

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.

输入

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.

输出

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.

示例输入

3
aaa
12
aabaabaabaab
0

示例输出

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

 

#include<stdio.h>
#include<string.h>

void fnext (char *T,int next[])
{
    int j = 0,k = -1;
    next[0] = -1;

    while (T[j] != '\0')
    {
        if (k == -1 || T[j] == T[k])
        {
            j++;
            k++;
            if(j%(j-k)==0&&j/(j-k)>1)
              printf("%d %d\n",j,j/(j-k));
            next[j] = k;
        }
        else
            k = next[k];
    }
}

char s[1000001];
int next[1000000];

int main()
{
    int n,N = 1;
    while (scanf ("%d",&n) && n)
    {
        scanf ("%s",s);
        printf ("Test case #%d\n",N);
        fnext(s,next);
        N++;
        printf ("\n");
    }

    return 0;
}

开始的困难是没有注意到k-j的含义，虽然因为在匹配过程中，可以保证前面的k个元素是串出现过或已匹配的，加上现在已经匹配了j个串，如果有循环节，那么肯定会有后k个字符在串中与j个字符的串的除最前面一个循环节外全部匹配，会满足n*（j-k)=j;