本文主要是介绍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
提示
来源
Southeastern European Regional Programming Contest
示例程序
#include <stdio.h>
#include <string.h>
char p[1000002];
int f[1000002];
int main()
{int n, kase = 0, i;while(scanf("%d",&n)==1&&n){scanf("%s",p);f[0]=0;f[1]=0;for(i = 1; i < n;i++){int j = f[i];while(j&&p[i]!=p[j])j=f[j];f[i+1]=(p[i]==p[j]?j+1:0);}printf("Test case #%d\n",++kase);for(i = 2; i <= n; i++)if(f[i]>0&&i%(i-f[i])==0)printf("%d %d\n",i,i/(i-f[i]));printf("\n");}return 0;
}这篇关于Period（KMP算法）的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
