hdu4333

题解：

EX_KMP

先把串复制一遍放到后面

这样旋转就是每一个前缀了

然后做一个EX_KMP

然后看一下后一个字符谁大谁小

代码：

#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
#define next ____next
const int N=;
char s[N];
int T,next[N],cas;
void getnext(char *a,int len)
{
    int i=-,j=;
    next[]=-;
    while (j<len)
     {
         if (i==-||a[i]==a[j])next[++j]=++i;
         else i=next[i];
     }
}
void getex(char *a,int len)
{
    int k=,i=;
    next[]=len;
    while (k+<len&&a[k]==a[k+])k++;
    next[]=k;
    k=;
    while (++i<=len/)
     {
         int maxr=next[k]+k-;
         next[i]=min(next[i-k],max(,maxr-i+));
         while (i+next[i]<len&&a[next[i]]==a[next[i]+i])next[i]++;
         if (i+next[i]>k+next[k])k=i;
     }
}
int main()
{
    scanf("%d",&T);
    while (T--)
     {
         scanf("%s",&s);
         int len=strlen(s);
        getnext(s,len);
        int tmp=len%(len-next[len])==?len/(len-next[len]):;
        for (int i=;i<=len;i++)s[i+len]=s[i];
        getex(s,len*);
        int a=,b=,c=;
        for (int i=;i<len;i++)
         {
             if (next[i]>=len)b++;
             else if (s[next[i]+i]>s[next[i]])c++;
             else a++;
         }
        printf("Case %d: %d %d %d\n",++cas,a/tmp,b/tmp,c/tmp);
     }
}