kuangbin专题十六 KMP&&扩展KMP HDU3347 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.

Input  Each line contains one line the string S with length N (N <= 1000000) formed by lower case letters.OutputOutput four integers separated by one space,
lexicographically fisrt string’s Rank (if there are multiple answers,
choose the smallest one), the string’s times in the N generated strings,
lexicographically last string’s Rank (if there are multiple answers,
choose the smallest one), and its times also.Sample Input

abcder
aaaaaa
ababab

Sample Output

1 1 6 1
1 6 1 6
1 3 2 3

只知道最小最大表示法。但是名次没思路。 后来看题解是循环节。。。。
脑子真是废了。。  循环节用next数组搞定 即可

 #include<stdio.h>
 #include<string.h>
 #include<algorithm>
 using namespace std;
 const int maxn=;
 char s[maxn],t[maxn];
 int Next[maxn],len;

 void prekmp(char* s) {
     int i,j;
     j=Next[]=-;
     i=;
     while(i<len) {
         while(j!=-&&s[i]!=s[j]) j=Next[j];
         if(s[++i]==s[++j]) Next[i]=Next[j];
         else Next[i]=j;
     }
 }

 int getmin(char* str) {
     int len2=strlen(str);
     int i=,j=,k=;
     while(i<len&&j<len&&k<len) {
         int tmp=s[(i+k)%len2]-s[(j+k)%len2];
         if(!tmp) k++;
         else {
             if(tmp<) j+=k+;
             else i+=k+;
             if(i==j) j++;
             k=;
         }
     }
     return min(i,j);
 }

 int getmax(char* str) {
     int len2=strlen(str);
     int i=,j=,k=;
     while(i<len&&j<len&&k<len) {
         int tmp=s[(i+k)%len2]-s[(j+k)%len2];
         if(!tmp) k++;
         else {
             if(tmp<) i+=k+;
             else j+=k+;
             if(i==j) j++;
             k=;
         }
     }
     return min(i,j);
 }

 int main() {
     while(~scanf("%s",s)) {
         len=strlen(s);
         prekmp(s);
         int num=,len1=len-Next[len];
         if(len%len1==)
             num=len/len1;
         strcpy(t,s);
         strcat(s,t);
         printf("%d %d %d %d\n",getmin(s)+,num,getmax(s)+,num);
     }
 }