最大最小表示法以及字符串的循环次数

#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define p_queue priority_queue

ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}
int n;
char s[2000005];
int zxbs()
{
    int i = 0 , j = 1 , k = 0;
    while(i < n && j < n && k < n)
    {
        int temp = s[(i+k)%n] - s[(j+k)%n];
        if(!temp) k ++;
        else
        {
            if(temp > 0) i += k+1;
            else j += k+1;
            if(i == j) j ++;
            k = 0;
        }
    }
    return min(i,j);
}
int zdbs()
{
    int i = 0 , j = 1 , k = 0;
    while(i < n && j < n && k < n)
    {
        int temp = s[(i+k)%n] - s[(j+k)%n];
        if(!temp) k ++;
        else
        {
            if(temp > 0) j += k+1;
            else i += k+1;
            if(i == j) j ++;
            k = 0;
        }
    }
    return min(i,j);
}
int z[2000005];
int getNext()
{
    mem(z,0);
    for(int i = 1 ; i < n ; i ++)
    {
        int j = z[i-1];
        while(j > 0 && s[j] != s[i]) j = z[j-1];
        if(s[i] == s[j]) j ++;
        z[i] = j;
    }
    if(n%(n-z[n-1]) == 0)
        return n/(n-z[n-1]);
    else
        return 1;
}
int main(void)
{
    while(scanf("%s",s)!=EOF)
    {
        n = strlen(s);
        int cnt = getNext();
        int index1 = zxbs();
        int index2 = zdbs();
        printf("%d %d %d %d\n",index1+1,cnt,index2+1,cnt);
    }
}