解题思路:
最小表示法模板题。
详解见http://blog.csdn.net/zy691357966/article/details/39854359
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<queue>
#include<vector>
#include<set>
using namespace std;
int getint()
{
int i=0,f=1;char c;
for(c=getchar();(c!='-')&&(c<'0'||c>'9');c=getchar());
if(c=='-')c=getchar(),f=-1;
for(;c>='0'&&c<='9';c=getchar())i=(i<<3)+(i<<1)+c-'0';
return i*f;
}
const int N=300005;
int n,a[N<<1];
int find()
{
int i=1,j=2;
while(i<=n&&j<=n)
{
int k=0;
while(k<n&&a[i+k]==a[j+k])k++;
if(k==n)return i;
if(a[i+k]>a[j+k])i=i+k+1;
else j=j+k+1;
if(i==j)j++;
}
return min(i,j);
}
int main()
{
//freopen("lx.in","r",stdin);
n=getint();
for(int i=1;i<=n;i++)a[i]=getint();
for(int i=n+1;i<=n*2;i++)a[i]=a[i-n];
int p=find();
for(int i=p;i<=p+n-2;i++)
cout<<a[i]<<" ";
cout<<a[p+n-1];
return 0;
}