Description
Given a sequence, {A1, A2, ..., An} which is guaranteed A1 > A2, ..., An, you are to cut it into three sub-sequences and reverse them separately to form a new one which is the smallest possible sequence in alphabet order.
The alphabet order is defined as follows: for two sequence {A1, A2, ..., An} and {B1, B2, ..., Bn}, we say {A1, A2, ..., An} is smaller than {B1, B2, ..., Bn} if and only if there exists such i ( 1 ≤ i ≤ n) so that we have Ai < Bi and Aj = Bj for each j < i.
Input
The first line contains n. (n ≤ 200000)
The following n lines contain the sequence.
Output
output n lines which is the smallest possible sequence obtained.
Sample Input
5
10
1
2
3
4
Sample Output
1
10
2
4
3
Hint
#include<cstdio> #include<cstring> #include<iostream> #include<algorithm> using namespace std; int n,k,pos,a[200020],b[200020],c[400020],sa[400020],rk[400020],tmp[400020]; int cmp(int i,int j) { if(rk[i]!=rk[j]) return rk[i]<rk[j]; int ri=i+k<=n?rk[i+k]:-1; int rj=j+k<=n?rk[j+k]:-1; return ri<rj; } int main() { scanf("%d",&n); for(int i=1;i<=n;i++) { scanf("%d",&a[i]); b[n-i]=a[i]; } for(int i=0;i<n;i++) { sa[i]=i; rk[i]=b[i]; } sa[n]=n; rk[n]=-1; for(k=1;k<=n;k<<=1) { sort(sa,sa+n+1,cmp); tmp[sa[0]]=0; for(int i=1;i<=n;i++) { tmp[sa[i]]=tmp[sa[i-1]]+cmp(sa[i-1],sa[i]); } for(int i=0;i<=n;i++) { rk[i]=tmp[i]; } } sort(sa,sa+n+1,cmp); for(int i=0;i<=n;i++) { if(sa[i]!=0&&sa[i]!=1&&sa[i]!=n) { pos=sa[i]; break; } } int len=n-pos; int cnt=0; for(int i=n;i>=len+1;i--) { c[cnt++]=a[i]; } for(int i=cnt;i<cnt*2;i++) { c[i]=c[i-cnt]; } n=cnt*2; for(int i=0;i<n;i++) { sa[i]=i; rk[i]=c[i]; } sa[n]=n; rk[n]=-1; for(k=1;k<=n;k<<=1) { sort(sa,sa+n+1,cmp); tmp[sa[0]]=0; for(int i=1;i<=n;i++) { tmp[sa[i]]=tmp[sa[i-1]]+cmp(sa[i-1],sa[i]); } for(int i=0;i<=n;i++) { rk[i]=tmp[i]; } } for(int i=len;i>=1;i--) { printf("%d\n",a[i]); } sort(sa,sa+n+1,cmp); for(int i=0;i<=n;i++) { if(sa[i]+n/2<n&&sa[i]!=0) { for(int j=sa[i];j<=sa[i]+n/2-1;j++) { printf("%d\n",c[j]); } break; } } }