P1368 【模板】最小表示法

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
#include<cstdio>
#include<algorithm>
using std::min;
const int MAXn = 3e5;

template <typename T> 
inline void read(T &a) {
    register char c;while (c = getchar(), c < '0' || c > '9');register T x(c - '0');while (c = getchar(), c >= '0' && c <= '9') {x = (x << 1) + (x << 3) + (c ^ 48);}a = x;  
}
template <typename T, typename ...Argv>
inline void read(T &n, Argv &...argv) {
    read(n), read(argv...);
}

int n, a[MAXn * 2 + 10], begin;
signed main() {
    read(n);
    for (int i = 1; i <= n; ++i) {
        read(a[i]); a[i + n] = a[i];
    }
    int i = 1, j = 2, k = 0;
    while (true) {
        if (i > n || j > n) {
            begin = min(i, j);
            break;
        }
        k = 0;
        while (a[i + k] == a[j + k] && k < n) ++k;
        if (k == n) {
            begin = i;
            break;
        }
        if (a[i + k] > a[j + k]) {
            i = i + k + 1;
            if (i == j) ++i;
        } else {
            j = j + k + 1;
            if (i == j) ++j;
        }
    }
    for (int i = 0; i < n; ++i) {
        printf("%d ", a[begin + i]);
    }
}