[kuangbin带你飞]专题十六 KMP & 扩展KMP & Manacher F - The Minimum Length HUST - 1010 （kmp循环节）...

阅读量：4557 次

发布时间：2019-06-08

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

F - The Minimum Length HUST - 1010

题目链接：

题目：

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.

InputMultiply 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.

OutputFor each line, output an integer, as described above.Sample Input

bcabcabefgabcdefgabcde

Sample Output

37 题意：求最小循环节的长度 思路：kmp中n-next[n]就是最小循环节的长度，由于现在该题不支持提交，我就贴一下我写的

// // Created by HJYL on 2019/8/15.//#include 
      
       #include 
       
        #include 
        #include 
         
          #include 
          
           #include 
           
            #include 
            
             #include 
             
              #include 
              
               #include 
               
                #include 
                
                 #include 
                 
                  using namespace std;const int maxn=1e6+10;char str[maxn];int nextt[maxn];void getnext(){ int i=0,j=-1; nextt[0]=-1; int n=strlen(str); while(i

转载于:https://www.cnblogs.com/Vampire6/p/11360768.html

你可能感兴趣的文章

学号《信息安全系统设计基础》第7周学习总结（一）