[POJ - 2406] Power Strings（KMP）

最新推荐文章于 2021-07-19 16:19:31 发布

原创最新推荐文章于 2021-07-19 16:19:31 发布 · 252 阅读

0 ·

CC 4.0 BY-SA版权

HPU2017 同时被 3 个专栏收录

72 篇文章

订阅专栏

POJ

5 篇文章

订阅专栏

KMP

3 篇文章

订阅专栏

本文介绍了解决PowerStrings问题的方法，通过KMP算法找出字符串的最大重复周期，从而确定输入字符串是否可以由某个子串重复构成。文章提供了一个完整的C++实现示例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Link：http://poj.org/problem?id=2406

Power Strings

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 50548		Accepted: 21083

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

题解：

KMP，next[]表示模式串如果第i位(设str[0]为第0位)与文本串第j位不匹配则要回到第next[i]位继续与文本串第j位匹配。则模式串第1位到next[n]与模式串第n-next[n]位到n位是匹配的。所以思路和上面一样，如果n%（n-next[n]）==0,则存在重复连续子串，长度为n-next[n]。

例如：a b a b a b

next: -1 0 0 1 2 3 4

next[n]==4,代表着，前缀abab与后缀abab相等的最长长度，这说明，ab这两个字母为一个循环节，长度=n-next[n]

Code：

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
using namespace std;
const int maxn=1e6+10;
char s[maxn];
int next[maxn];
void getnext(char *s,int m)
{
	int i=0,j=0;
	next[0]=-1,j=next[i];
	while(i<m)
	{
		if(j==-1||s[i]==s[j])
			next[++i]=++j;
		else
			j=next[j];
	}
}
int main()
{
	while(~scanf("%s",s),s[0]!='.')
	{
		int l=strlen(s);
		getnext(s,l);
		int a=l-next[l];
		if(l%a==0)
			printf("%d\n",l/a);
		else
			printf("1\n");
	}
return 0;
}