【POJ】2406Power Strings（KMPnext数组求解循环节问题）

最新推荐文章于 2021-09-27 15:20:53 发布

红点雷龙XL

最新推荐文章于 2021-09-27 15:20:53 发布

阅读量289

点赞数 1

分类专栏：数据结构--KMP

本文链接：https://blog.csdn.net/wentong_Xu/article/details/87984570

版权

数据结构--KMP 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 62365		Accepted: 25776

Description

Given two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concatenation as multiplication, exponentiation by a non-negative integer is defined in the normal way: a^0 = "" (the empty string) and a^(n+1) = a*(a^n).

Input

Each test case is a line of input representing s, a string of printable characters. The length of s will be at least 1 and will not exceed 1 million characters. A line containing a period follows the last test case.

Output

For each s you should print the largest n such that s = a^n for some string a.

Sample Input

abcd
aaaa
ababab
.

Sample Output

1
4
3

Hint

This problem has huge input, use scanf instead of cin to avoid time limit exceed.

Source

Waterloo local 2002.07.01

题目大意：现在给你一个字符串，问你这个字符串是是由最小循环节循环几次的到的

思路：可能上面的题意说的不大好，但是这个题目的意思还是挺好理解的

下面说一下思路：

next数组，我们知道里面保存的是他的前面字符串的最大前缀后缀相等的位数，

然后我们知道，什么时候len/（len-next[len]）是大于1的，是那个next数组的数值大于len的一半的时候，

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<string>
using namespace std;
const int maxn=1000005;
int next[maxn];
char str[maxn];
void getnext(char p[])
{
    next[0]=-1;
    int j=0,k=-1;
    int len=strlen(p);
    while(j<len)
    {
        if(k==-1||p[j]==p[k])
        {
            k++,j++;
            next[j]=k;
        }
        else
            k=next[k];
    }
}
int main()
{
    while(scanf("%s",str))
    {
        if(str[0]=='.') break;
        int len=strlen(str);
        getnext(str);
        if(len%(len-next[len])==0)
        {
            cout<<len/(len-next[len])<<endl;
        }
        else
            cout<<1<<endl;
    }
}