【ZOJ1729】Hidden Password【最小表示法】

模板。

#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn = 200005;int n;char s[maxn];int MR() {int i = 0, j = 1;for(int k; i < n && j < n; ) {k = 0;for(; k < n && s[i + k] == s[j + k]; k++);if(k == n) return i;if(s[i + k] > s[j + k]) i = i + k + 1;else j = j + k + 1;if(i == j) j++;}return min(i, j);}int main() {int T; scanf("%d", &T);while(T--) {scanf("%d%s", &n, s);for(int i = 0; i < n; i++) s[n + i] = s[i];int pos = MR();printf("%d\n", pos);}return 0;}