Järjestys

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int main() {
	int n;
	cin >> n;
	int t[n];
	for (int i = 0; i < n; i++) {
		int k;
		cin >> k;
		t[i] = k;
	}
	vector<int> steps;
	for (int *i = t+n; i != t; --i) {
		auto j = max_element(t, i, less<int>());
		if (j == i - 1) continue;
		if (t != j) {
			reverse(t, j + 1);
			steps.push_back(j+1-t);
		}
		reverse(t, i);
		steps.push_back(i-t);
	}
	cout << steps.size() << endl;
	for (int &step : steps) cout << step << " ";
	cout << endl;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED