Period +uvalive+next数组

最新推荐文章于 2020-03-08 21:48:27 发布

974792789

最新推荐文章于 2020-03-08 21:48:27 发布

阅读量431

点赞数

分类专栏： KMP

本文链接：https://blog.csdn.net/u012870383/article/details/38057891

版权

KMP 专栏收录该内容

5 篇文章 0 订阅

订阅专栏

Period

Time Limit: 3000MS

Memory Limit: Unknown

64bit IO Format: %lld & %llu

[Submit] [Go Back] [Status]

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

解决方案：在做这题的时候傻逼了，直接对每段字符求最长前后缀，若是周期串，最短循环部分就是前后缀与当前字符段匹配之后的错位部分。

code：#include<iostream>
#include<cstdio>
#include<cstring>
#define MMAX 1000005
using namespace std;
int next[MMAX];
int num[MMAX];
char text[MMAX];
int n;
void getnext(int len)
{

    int i=0,j=-1;
    next[0]=-1;
    while(i<len)
    {
        if(j==-1||text[i]==text[j])
        {
            i++,j++;
            next[i]=j;
        }
        else j=next[j];
    }


}
int main()
{
    int k=0;

    while(~scanf("%d",&n)&&n)
    {
        scanf("%s",text);
        int len=strlen(text);
        getnext(len);
        printf("Test case #%d\n",++k);
        for(int i=2;i<=n;i++)
        if(next[i]>0&&i%(i-next[i])==0){
            printf("%d %d\n",i,i/(i-next[i]));
        }
        cout<<endl;

    }

}