HDU-3374 String Problem （最小最大表示法）

#include<iostream>
#include<set>
#include<map>
#include<vector>
#include<string>
#include <cstring> 
#include<algorithm>
using namespace std;
const int maxn = 1e6+9;
int nex[maxn];
int len ; 
string s;
void getnext(){
    int i = 0,j=-1;
    nex[i] = j;
    while(i<len){
        if(j==-1||s[i]==s[j]){
            nex[++i] = ++j;
        }else j = nex[j];
    }
}
int getM(int flag){
    int i=0,j=1,k=0;
    while(i<len&&j<len&&k<len){
        int t=s[(j+k)%len]-s[(i+k)%len];
        if(t==0)k++;
        else{
            if(flag){if(t>0)j+=k+1;else i+=k+1;}
            else{if(t>0)i+=k+1;else j+=k+1;}
            if(i==j)j++;k=0;
        }
    }return min(i,j);
}
int main(){
    
    while(cin>>s){
        len = s.size();
        int ans,ansmax,ansmin;
        getnext(); 
        ansmax = getM(0)+1;
        ansmin = getM(1)+1;
        //有循环节就输出循环节个数，否则输出1 
        if(!(len%(len-nex[len]))){
            ans = len/(len-nex[len]);
        }else ans = 1;
        
        cout<<ansmin<<" "<<ans<<" "<<ansmax<<" "<<ans<<endl;        
    }    
}