hust--------The Minimum Length (最短循环节)(kmp)

F - The Minimum Length

Time Limit:1000MS     Memory Limit:131072KB     64bit IO Format:%lld & %llu

Submit Status

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

代码：

     #include<iostream>
     #include<cstring>
     #include<cstdlib>
     #include<cstdio>
     using namespace std;
     const int maxn=;
     int next[maxn];
     char str[maxn];
     int main()
     {
       int i,j;
       while(scanf("%s",str)!=EOF)
       {
           j=-;
           i=;
           next[i]=-;
           int len=strlen(str);
           while(i<len)
           {
               if(j==-||str[i]==str[j])
               {
                   i++;
                   j++;
                  if(str[i]==str[j])
                       next[i]=next[j];
                  else next[i]=j;
               }
               else j=next[j];
           }
           //得到最大回缩长度（即最小循环长度;
          int cir_len=len-next[len];
           printf("%d\n",cir_len);
       }
         return ;
     }