HUST1010-The Minimum Length

The Minimum Length

时间限制：1秒 内存限制：128兆

2266 次提交 837 次通过

题目描述

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.

输入

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.

输出

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

样例输入

bcabcabefgabcdefgabcde

样例输出

37

#include <iostream>#include <cstdio>#include <cmath>#include <algorithm>#include <cstring>using namespace std;#define N 1000005char str[N];int f[N];int main(){    while(~scanf("%s",str))    {        int len=strlen(str);        f[0]=-1;        for(int i=0;i<len;i++)        {            int k=f[i];            while(k>=0&&str[i]!=str[k]) k=f[k];            f[i+1]=k+1;        }        printf("%d\n",len-f[len]);    }    return 0;}