hust 1010 最短循环节

The Minimum Length

Time Limit: 1 Sec Memory Limit: 128 MB
Submissions: 405 Solved: 131

Description

There is a string A. The length of A is less than 1,000,000. I rewrite it again and again. Then I got a new string: AAAAAA...... Now I cut it from two different position and get a new string B. Then, give you the string B, can you tell me the length of the shortest possible string A.
For example, A="abcdefg". I got abcdefgabcdefgabcdefgabcdefg.... Then I cut the red part: efgabcdefgabcde as string B. From B, you should find out the shortest A.

Input

Multiply Test Cases.
For each line there is a string B which contains only lowercase and uppercase charactors.
The length of B is no more than 1,000,000.

Output

For each line, output an integer, as described above.

Sample Input

bcabcab
efgabcdefgabcde

Sample Output

3
7

HINT

Source

#include<iostream>
#include<cstring>
using namespace std;
int next[1000005];
char s[1000005];
int len;
void get_next()
{
	int i=0,j=-1;
	next[0]=-1;
	len=strlen(s);
	while(i<len)
	{
		if(j==-1||s[i]==s[j])
		{
			++i,++j;
			next[i]=j;
		}
		else
		j=next[j];
	}
}
int main()
{
	
    while(cin>>s)
    {
    	len=strlen(s);    	
    	
    	get_next();    	
    	
    	cout<<len-next[len]<<endl;    	
    	
    }
	return 0;
}