Järjestys

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {

	int n;
	cin >> n;
	
	int x[n];
	vector<int> moves;
	for(int i = 0; i < n; i++)
		cin >> x[i];

	for(int i = n - 1; i >= 0; i--) {
		for(int ii = i; ii >= 0; ii--) {
			if(x[ii] == i + 1) {
				if(ii == i) break;
				reverse(x, x + ii + 1);
				reverse(x, x + i + 1);

				moves.push_back(ii + 1);
				moves.push_back(i + 1);
				break;
			}
		}
	}

	cout << moves.size() << '\n';
	for(int m : moves)
		cout << m << " ";
	cout << '\n';

	return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED