Period
Time Limit: 3000MS | Memory Limit: 30000K | |
Total Submissions: 14503 | Accepted: 6892 |
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 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.
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
Source
题意:给定一个长度为n的字符串,对字符串的每一个前缀s[i],判断能否由某个长度小于它的前缀s[j]重复若干次得来,若能,输出i和重复的次数。
思路:维护出KMP的next数组,对s的每一位i查看其next[i],设la = next[i]+1,lb = i+1-la,则若la%lb == 0 说明s[i] 能由s[next[i]]重复而来,重复次数为(i+1)/lb。
#include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;
#define INF 1000000000
#define N 1000010
int n, nxt[N];
char str[N];
void getNext()
{
nxt[0] = -1;
for(int i = 1; i < n; i++)
{
int p = nxt[i-1];
for(; p != -1 && str[p+1] != str[i]; p = nxt[p]);
p = str[p+1] == str[i] ? p+1 : -1;
nxt[i] = p;
}
}
int main()
{
//freopen("C:\\Users\\zfh\\Desktop\\in.txt", "r", stdin);
int cas = 0;
while(scanf("%d", &n) != -1 && n)
{
scanf(" %s", str);
getNext();
printf("Test case #%d\n", ++cas);
for(int i = 1; i < n; i++)
{
int la = nxt[i]+1;
int lb = i+1-la;
if(la && la % lb == 0)
{
printf("%d %d\n", i+1, (i+1)/lb);
}
}
printf("\n");
}
return 0;
}