HUST 1010 The Minimum Length

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

---

【题目大意】
一堆废话，其实就是KMP求循环节。

---

【题目分析】
见题目大意

---

【代码】

#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
char a[1100001];
int ne[1100001],t;
int main()
{
    while (scanf("%s",a+1)!=EOF)
    {
        ne[1]=0;
        int l=strlen(a+1); 
        for (int i=2,j=0;i<=l;++i)
        {
            while (j&&a[j+1]!=a[i]) j=ne[j];
            if (a[j+1]==a[i]) j++;
            ne[i]=j;
        }
        printf("%d\n",l-ne[l]);
    }
}