hdu 4763 kmp ***

找AEAEA形式的字符串最长的A长度，E可以为空

只可意会，不可言传，懂kmp即可

 #include <stdio.h>
 #include <string.h>
 #include <iostream>
 #include <algorithm>
 #include <vector>
 #include <queue>
 #include <set>
 #include <map>
 #include <string>
 #include <math.h>
 #include <stdlib.h>
 #include <time.h>
 using namespace std;
 #define cl(a) memset(a,0,sizeof(a))
 #define ts printf("*****\n");
 void kmp_pre(char x[],int m,int nextt[])
 {
     int i,j;
     j = nextt[] = -;
     i = ;
     while(i < m)
     {
         while( - != j && x[i] != x[j] )j = nextt[j];
         nextt[++i] = ++j;
     }
 }
 char str[];
 int nextt[];
 bool f[];
 int main()
 {
     #ifndef ONLINE_JUDGE
     freopen("1.in","r",stdin);
     #endif
     int T;
     scanf("%d",&T);
     while(T--)
     {
         scanf("%s",str);
         int n = strlen(str);
         kmp_pre(str,n,nextt);
         memset(f,false,sizeof(f));
         int tmp = n;
         while(tmp > )
         {
             if(n >= *tmp)
             {
                 f[tmp] = true;
             }
             tmp = nextt[tmp];
         }
         int ans = ;
         for(int i = ;i <n-;i++)
         {
             tmp = i;
             while(tmp > )
             {
                 if(f[tmp] && i >= *tmp && n >= i+tmp)
                 {
                     ans = max(ans,tmp);
                     break;
                 }
                 tmp = nextt[tmp];
             }
         }
         printf("%d\n",ans);
     }
     return ;
 }