hdu3374 String Problem KMP+最大最小表示法

Give you a string with length N, you can generate N strings by left shifts. For example let consider the string “SKYLONG”, we can generate seven strings:
String Rank 
SKYLONG 1
KYLONGS 2
YLONGSK 3
LONGSKY 4
ONGSKYL 5
NGSKYLO 6
GSKYLON 7
and lexicographically first of them is GSKYLON, lexicographically last is YLONGSK, both of them appear only once.
  Your task is easy, calculate the lexicographically fisrt string’s Rank (if there are multiple answers, choose the smallest one), its times, lexicographically last string’s Rank (if there are multiple answers, choose the smallest one), and its times also.

题意：给出一个字符串，求出它循环同构的字符串中字典序最小的一个串的开始位置，以及有多少串是同样字典序最小的，然后同样求出字典序最大的串的这两个值

先用最大/最小表示法求出字典序最大或最小的串，并在原串的倍增串中进行KMP匹配。

 #include<stdio.h>
 #include<string.h>
 #include<algorithm>
 using namespace std;

 const int maxn=1e6+;
 char s[maxn<<],ss[maxn<<];
 char tmp[maxn];
 int p[maxn<<];

 inline int max(int a,int b){return a>b?a:b;}
 inline int min(int a,int b){return a<b?a:b;}

 int KMP(char s[],char t[]){
     int i,j,ans=;    //ans记录字符串出现次数
     int n=strlen(s),m=strlen(t);    //在题目中遇到过，其实strlen很慢，所以如果不先存起来可能有TLE的风险
     p[]=p[]=;    //初始化自匹配数组
     for(i=;i<m;i++){    //自匹配
         j=p[i];
         while(j&&t[i]!=t[j])j=p[j];
         p[i+]=t[i]==t[j]?j+:;
     }
     j=;            //注意 j=0
     for(i=;i<n-;i++){    //串匹配
         while(j&&s[i]!=t[j])j=p[j];
         if(s[i]==t[j])j++;
         if(j==m){
             ans++;        //此处记录出现次数（模板串在待匹配串中可重叠），或改为直接break表示是否出现过
         }
     }
     return ans;
 }

 int MINR(char s[],int l){
     for(int i=;i<l;++i)s[l+i]=s[i];
     s[*l]=;
     int i=,j=;
     while(i<l&&j<l){
         int k=;
         while(s[i+k]==s[j+k]&&k<l)++k;
         if(k==l)return min(i,j);
         if(s[i+k]>s[j+k])i=max(i+k+,j+);
         else j=max(j+k+,i+);
     }
     return min(i,j);
 }

 int MAXR(char s[],int l){
     for(int i=;i<l;++i)s[l+i]=s[i];
     s[*l]=;
     int i=,j=;
     while(i<l&&j<l){
         int k=;
         while(s[i+k]==s[j+k]&&k<l)++k;
         if(k==l)return min(i,j);
         if(s[i+k]<s[j+k])i=max(i+k+,j+);
         else j=max(j+k+,i+);
     }
     return min(i,j);
 }

 int main(){
     while(scanf("%s",s)!=EOF){
         int l=strlen(s);
         strcpy(ss,s);
         int pos=MINR(ss,l);
         for(int i=;i<l;++i)tmp[i]=ss[i+pos];
         tmp[l]=;
         printf("%d %d ",pos+,KMP(ss,tmp));
         strcpy(ss,s);
         pos=MAXR(ss,l);
         for(int i=;i<l;++i)tmp[i]=ss[i+pos];
         tmp[l]=;
         printf("%d %d\n",pos+,KMP(ss,tmp));
     }
     return ;
 }