hdu 4333 扩展kmp

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<map>
using namespace std;
const int MAXN=2000010;

int nextt[MAXN];
int extend[MAXN];

void pre_EKMP(char x[],int m,int nextt[])
{
nextt[0]=m;
int j=0;
while(j+1<m && x[j]==x[j+1])j++;
nextt[1]=j;
int k=1;
for(int i=2;i<m;i++)
{
int p=nextt[k]+k-1;
int L=nextt[i-k];
if(i+L<p+1)nextt[i]=L;
else
{
j=max(0,p-i+1);
while(i+j<m && x[i+j]==x[j])j++;
nextt[i]=j;
k=i;
}
}
}
void EKMP(char x[],char y[])
{
int n=strlen(y);
int m=strlen(x);
pre_EKMP(x,m,nextt);
int j=0;
while(j<n && j<m && x[j]==y[j])j++;
extend[0]=j;
int k=0;
for(int i=1;i<n;i++)
{
int p=extend[k]+k-1;
int L=nextt[i-k];
if(i+L<p+1)extend[i]=L;
else
{
j=max(0,p-i+1);
while(i+j<n && j<m && y[i+j]==x[j])j++;
extend[i]=j;
k=i;
}
}
}
void getnextt(char T[],int len)
{
int j,k;
j=0;k=-1;
nextt[0]=-1;
while(j<len)
{
if(k==-1 || T[j]==T[k])
nextt[++j]=++k;
else k=nextt[k];
}
}
char str1[MAXN],str2[MAXN];
int main()
{
#ifndef ONLINE_JUDGE
freopen("1.in","r",stdin);
#endif
int T;
int iCase=0;
scanf("%d",&T);
while(T--)
{
iCase++;
scanf("%s",str1);
int len=strlen(str1);
strcpy(str2,str1);
strcat(str2,str1);
EKMP(str1,str2);
/*for(int i=0;i<len*2;i++)
{
printf("%d ",extend[i]);
}
printf("\n");*/
int cnt1=0,cnt2=0,cnt3=0;
for(int i=0;i<len;i++)
{
if(extend[i]>=len)cnt2++;
else
{
if(str2[i+extend[i]]<str1[extend[i]])cnt1++;
else cnt3++;
}
}
getnextt(str1,len);
int t=len-nextt[len];
int tol=1;
if(len%t==0)tol=len/t;
printf("Case %d: %d %d %d\n",iCase,cnt1/tol,cnt2/tol,cnt3/tol);
}
return 0;
}