[BZOJ1398]Vijos1382寻找主人 Necklace

#include <cstdio>
#include <cstring> 
const int maxn = 1000000 + 10;
char s1[maxn], s2[maxn];
int fms(char *s){
    int len = strlen(s);
    int i = 0, j = 1, k = 0;
    int nxi, nxj, t;
    while(i < len && j < len && k < len){
        nxi = i + k; while(nxi >= len) nxi -= len;
        nxj = j + k; while(nxj >= len) nxj -= len;
        t = s[nxi] - s[nxj]; 
        if(t == 0) k++;
        else{
            if(t > 0) i += k + 1;
            else j += k + 1;
            if(i == j) j++;
            k = 0; 
        }
    }
    return i < j ? i : j;
}
int main(){
    scanf("%s%s", s1 + 1, s2 + 1);
    int len = strlen(s1 + 1), a = fms(s1 + 1) + 1, b = fms(s2 + 1) + 1; 
    bool flag = true;
    for(int aa = a, bb = b, i = 1; i <= len; i++){
        if(s1[aa++] != s2[bb++]){
            flag = false;
            break;
        }
        if(aa > len) aa -= len;
        if(bb > len) bb -= len;
    }
    if(flag){
        puts("Yes");
        for(int aa = a, i = 1; i <= len; i++){
            putchar(s1[aa++]);
            if(aa > len) aa -= len;
        }
    }
    else puts("No");
    return 0;
}