Rotations

#include <iostream>

using namespace std;

int main() {

	string s;
	cin >> s;
	int n = s.length();

	char min = -1;
	/*for (int i=0; i<n; ++i)
		if (min == -1 || s[i] < min) min = s[i];*/

	int level = 0;
	int left = n;
	int arr[n];
	for(int i=0; i<n; ++i)
		arr[i] = i;
	int arr_it = 0;
	while (left > 1 && level<(n+1)/2) {
		min = -1;
		arr_it = 0;
		for (int i=0; i<left; ++i) {
			if (min == -1 || s[(arr[i]+level) % n] < min) {
				min = s[(arr[i]+level) % n];
			}
		}
		for (int i=0; i<left; ++i) {
			if (s[(arr[i]+level) % n] == min) {
				arr[arr_it] = arr[i];
				++arr_it;
			}
		}
		if ((left+1)/2 < arr_it) {	// TODO: around! e.g. 'aabbaaabbaa'
			int maxs = 0;
			int maxsind = -1;
			int scount = 0;
			int currind = -1;

			for (int j=0; j<left; ++j) {
				if (s[(arr[j]+level) % n] == min) {
					++scount;
					if (scount > maxs) {
						if (currind == -1) currind = j;
						maxs = scount;
						maxsind = currind;
					}
				} else {
					scount = 0;
					currind = -1;
				}
			}
			cout << s.substr(arr[maxsind], n-arr[maxsind]) << s.substr(0,arr[0]) << "\n";
			return 0;
		}
		left = arr_it;
		++level;
	}

	/*cout << arr[0] << "\n";
	for (int i=0;i<n;++i)
		cout << arr[i] << " ";
	cout << "\n";*/
	/*for (int i=0; i<n; ++i)
		cout << s[(arr[0] + i) % n];
	cout << "\n";*/
	cout << s.substr(arr[0], n-arr[0]) << s.substr(0,arr[0]) << "\n";
	
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: UNKNOWN

Test 9

Verdict: UNKNOWN

Test 10

Verdict: UNKNOWN

Test 11

Verdict: UNKNOWN

Test 12

Verdict: UNKNOWN