Period
Time Limit: 3000MS | Memory Limit: 30000K | |
Total Submissions: 16756 | Accepted: 8063 |
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
题意:给你一个串,问你当前子串0-i(长度)循环节的数量。
分析:
kmp中的next数组求最小循环节的应用
例如
ababab next[6] = 4; 即
ababab
ababab
1~4位 与2~6位是相同的
那么前两位
就等于3、4位
3、4位就等于5、6位
……
所以 如果 能整除 也就循环到最后了
如果不能整除
就最后余下的几位不在循环内
例如
1212121
1212121
最后剩余1不能等于循环节
#include <iostream>
#include <cstdio>
using namespace std;
const int MAXN=1000000+10;
char s[MAXN];
int next[MAXN];
int n;
void get_next()
{
int i=0,j=-1;
next[0]=-1;
while(i<n)
{
if(j==-1||s[i]==s[j])next[++i]=++j;
else j=next[j];
}
}
void kmp()
{
for(int i=2;i<=n;++i)
{
int t=i-next[i];//循环节长度
if(i%t==0&&i/t>1)printf("%d %d\n",i,i/t);//如果 能整除 也就循环到最后了,如果不能整除,就最后余下的几位不在循环内
}
}
int main()
{
int t=0;
while(~scanf("%d",&n)&&n)
{
t++;
scanf("%s",s);
printf("Test case #%d\n",t);
get_next();
kmp();
printf("\n");
for(int i=0;i<=n;++i)printf("%d ",next[i]);
}
return 0;
}