本文共 1129 字，大约阅读时间需要 3 分钟。

F - The Minimum Length Crawling in process... Crawling failed Time Limit:1000MS     Memory Limit:131072KB     64bit IO Format:%lld & %llu HUST 1010 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
   
    #include
    
     #include
     
      using namespace std;int nexta[1000010];void getnext(string s){	int i=0,j=-1;	nexta[0]=-1;	while(i
      
       >s)	{		getnext(s);		k=s.size();		n=k-nexta[k];//循环节		cout<
       
        <
       
      
     
    
   

转载地址：http://stfci.baihongyu.com/