hust 1010 - The Minimum Length KMP求循环节



                          1010 - The Minimum Length

Time Limit: 1s Memory Limit: 128MB

Submissions: 1346 Solved: 508

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 abcd efgabcdefgabcdefgabcdefg.... 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

废话一堆，就是求循环节 ans=len-nex[len]  (如果从数组下标0开始读入字符串);

#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
#include<climits>
#include<string>
#include<algorithm>
#include<queue>
#include<set>
#include<vector>
#include<map>
#include<stack>
//typedef long long ll;
//by yskyskyer123
using namespace std;
const int maxm=1000000+20;
char M[maxm];
int nex[maxm];
void getnex()
{
    int j=nex[1]=0;
    for(int i=1;M[i];)
    {
        while(j&&M[i]!=M[j])  j=nex[j];
        nex[++i]=++j;
    }
}
int main()
{
    int i,j;
    while(~scanf("%s",M+1))
    {
        getnex();
        int m=strlen(M+1);
        printf("%d\n",m+1-nex[m+1]);

    }





}