bzoj 2882（最小表示法）

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int MAXN=3e5+2;
int a[MAXN<<1],n;
inline int read() {
int x=0,f=1;char c=getchar();
while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
while (c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
return x*f;
}
inline int MR() {
int i=0,j=1;
for (int k;i<n&&j<n;) {
for (k=0;a[i+k]==a[j+k];++k);
if (k==n) return i;
if (a[i+k]>a[j+k]) i+=k+1;
else j+=k+1;
if (i==j) ++j;
}
return i<j?i:j;
}
int main() {
//  freopen("bzoj 2882.in","r",stdin);
n=read();
for (register int i=0;i<n;++i) a[i+n]=a[i]=read();
int pos=MR();
for (register int i=0;i<n-1;++i) printf("%d ",a[pos+i]);
printf("%d\n",a[pos+n-1]);
return 0;
}