40pts求调

#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define INF 1e18
using namespace std;
ll n;
ll a[20005];
ll f(){
    for(ll i = 0; i < n; i++) a[n + i] = a[i];
    ll i = 0, j = 1, k = 0;
    while(i < n && j < n && k < n){
        if(a[(i + k) % n] == a[(j + k) % n]) k++;
        else{
            if(a[(i + k) % n] > a[(j + k) % n]) i = i + k + 1;
            else j = j + k + 1;
            if(i == j) i++;
            k = 0;
        }
    }
    ll res = min(i, j);
    return res;
}
int main(){
    cin >> n;
    for(ll i = 0; i < n; i++) cin >> a[i];
    ll cnt = f();
    for(ll i = 0; i < n; i++) cout << a[(i + cnt) % n] << " ";
    return 0;
}