hust 1010 The Minimum Length(KMP)

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

Source

/*

刚开始没看懂题意，搜索了一下题意。
顺便刷一刷bin神的专题。。这里边的专题经典多了
Time:2015-3-26 16:42
*/
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAX=1000000+10;
char str[MAX];
int nxt[MAX];
void Get_next(){
    int i,j;
    i=0;j=-1;
    nxt[0]=-1;
    while(str[i]){
        if(j==-1||str[i]==str[j]){
            i++;j++;
            nxt[i]=j;
        }else
            j=nxt[j];
    }
}
int main(){
    while(scanf("%s",str)!=EOF){
        Get_next();
        int len=strlen(str);
        printf("%d\n",len-nxt[len]);
    }
return 0;
}