BZOJ2882 工艺

hzwer："输出最小表示"

感觉就是kmp的思想呢？

/**************************************************************
    Problem: 2882
    User: rausen
    Language: C++
    Result: Accepted
    Time:492 ms
    Memory:1976 kb
****************************************************************/
 
#include <cstdio>
#include <algorithm>
 
using namespace std;
const int N = 300005;
 
int n;
int a[N];
 
int work() {
    int i = 0, j = 1, k = 0, tmp;
    while (i < n && j < n && k < n) {
        tmp = a[(i + k) % n] - a[(j + k) % n];
        if (!tmp) ++k;
        else {
            if (tmp > 0) i += k + 1;
            else j += k + 1;
            if (i == j) ++i;
            k = 0;
        }
    }
    return min(i, j);
}
 
int main() {
    int i, st;
    scanf("%d", &n);
    for (i = 0; i < n; ++i)
        scanf("%d", a + i);
    st = work();
    printf("%d", a[st % n]);
    for (i = 1; i < n; ++i)
        printf(" %d", a[(st + i) % n]);
    return 0;
}