HDU1358 Period【KMP】

原创于 2018-11-22 20:57:33 发布 · 264 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

算法专栏收录该内容

356 篇文章

订阅专栏

本文介绍如何使用KMP算法中的next数组来判断一个字符串的前缀是否为周期字符串，以及确定其循环节的长度和数量。通过解析HDU1358问题，提供了一段AC的C++代码示例。

Period

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 13519 Accepted Submission(s): 6330

Problem 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 AK , 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

问题链接：HDU1358 Period

问题描述：给定字符串S（长度为N），问S的长度为 i （1<i<=n ）的前缀是否为循环串，如果是打印前缀长度 i ，以及有多少个循环节。比如样例一aaa。长度为2的前缀为aa，循环节长度为1（即a），有2个循环节，则输出2 2。长度为3的前缀为aaa，循环节长度为1（即a），有3个循环节，则输出3 3。

解题思路：对KMP中next数组的运用。要记住循环节的长度为 i-next[i]。如果i是循环节长度的倍数（不能为1倍），则可输出，具体看程序。

AC的C++程序：

#include<iostream>
#include<cstring>

using namespace std;

const int N=1000010;

char p[N];
int Next[N];

void GetNext(char p[],int next[])
{
	next[0]=-1;
	int k=-1,j=0,plen=strlen(p);
	while(j<plen)
	{
		//p[k]表示前缀 p[j]表示后缀
		if(k==-1||p[k]==p[j])
		{
			k++;
			j++;
			next[j]=k;
		}
		else
		  k=next[k];
	}
}

int main()
{
	int n,cnt=1;
	while(~scanf("%d",&n)&&n)
	{
		scanf("%s",p);
		GetNext(p,Next);
		printf("Test case #%d\n",cnt++);
		for(int i=2;i<=n;i++)//枚举前缀长度 
		{
			int l=i-Next[i];//循环节的长度 
			if(i%l==0&&i/l>1)
			  printf("%d %d\n",i,i/l); 
		}
		printf("\n"); 
	}
	return 0;
 }