Järjestys

#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>

using namespace std;

unsigned long n;
string inf;
string ins;
string tmp;
unsigned long index;
unsigned long a;
unsigned long b;
vector<unsigned long> out;

int main(){
	
	getline(cin, inf);
	n = stoul(inf);
	
	unsigned long x[n];
	unsigned long y[n];
	
	getline(cin, ins);
	stringstream t(ins);
	
	index = 0;
	while(t >> tmp){
		x[index] = stoul(tmp);
		index++;
	}
	
	copy(x, x + n, y);
	sort(x, x + n);
	
	index = n - 1;
	while(index > 0){
		a = index;
		for(unsigned long i = a; i; i--){
			if(y[i] == x[i]){
				index--;
			}
			if(y[i - 1] != x[i - 1]){
				break;
			}
		}
		
		for(unsigned long i = a; i; i--){
			if(y[i] == x[index]){
				b = i;
				break;
			}
		}
		
		out.push_back(b + 1);
		reverse(y, y + b + 1);
		out.push_back(index + 1);
		reverse(y, y + index + 1);
	}
	
	for(unsigned int i = 0; i < out.size(); i++){
		cout << out[i] << " ";
	}
	
	return 0;
	
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: RUNTIME ERROR

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED