一、题目描述
二、算法分析说明与代码编写指导
三、AC 代码
#include<cstdio>
#include<algorithm>
#pragma warning(disable:4996)
using namespace std;
unsigned n, f[300000];
template<class _Ty> inline size_t minexp(const _Ty* const a, const size_t& n) {
size_t k = 0, i = 0, j = 1;
while (k < n && i < n && j < n) {
if (a[(i + k) % n] == a[(j + k) % n])++k;
else {
a[(i + k) % n] > a[(j + k) % n] ? i = i + k + 1 : j = j + k + 1;
if (i == j)++i;
k = 0;
}
}
return min(i, j);
}
int main() {
scanf("%u", &n);
for (unsigned i = 0; i < n; ++i)scanf("%u", f + i);
for (size_t i = minexp(f, n), j = 0; j < n; ++i, ++j) {
if (i == n)i = 0;
printf("%u ", f[i]);
}
return 0;
}
#include<cstdio>
#include<algorithm>
#pragma warning(disable:4996)
using namespace std;
unsigned n, f[300000];
template<class _Ty> inline size_t minexp(const _Ty* const a, const size_t& n) {
size_t k = 0, i = 0, j = 1, p, q;
while (k < n && i < n && j < n) {
p = i + k >= n ? i + k - n : i + k; q = j + k >= n ? j + k - n : j + k;
if (a[p] == a[q])++k;
else {
a[p] > a[q] ? i += k + 1 : j += k + 1;
k = 0; if (i == j)++i;
}
}
return min(i, j);
}
int main() {
scanf("%u", &n);
for (unsigned i = 0; i < n; ++i)scanf("%u", f + i);
for (size_t i = minexp(f, n), j = 0; j < n; ++i, ++j) {
if (i == n)i = 0;
printf("%u ", f[i]);
}
return 0;
}