BZOJ 2176: Strange string【字符串最小表示法

#include<bits/stdc++.h>
#define MAXN 10000005
using namespace std;	int n;
unsigned char s[MAXN];

int Min_Representation(){
int i,j,k;
for(i=1,j=2,k=0;i<=n&&j<=n&&k<=n;k=0){
while(s[i+k>n?i+k-n:i+k]==s[j+k>n?j+k-n:j+k]&&k<n)	++k;
if(k==n)	break;
if(s[i+k>n?i+k-n:i+k]>s[j+k>n?j+k-n:j+k])	i+=k+1;
else	j+=k+1;
if(i==j)	++j;
}
return min(i,j);
}

int main(){
scanf("%d\n",&n);
fread(s+1,1,n,stdin);
int ans=Min_Representation();
if(ans==1)	fwrite(s+1,1,n,stdout);
else	fwrite(s+ans,1,n-ans+1,stdout),fwrite(s+1,1,ans-1,stdout);
return 0;
}