Järjestys

#include <iostream>
#include <sstream>
#include <cstring>
#include <cstdlib>
 
using namespace std;
 
 
/*int* turn(int* arr, int last) {
 
	return arr;
	
	
}*/
 
int main() {
	std::ostringstream turns_oss;
 
	unsigned int length;
	unsigned int turns_count = 0;
	
    cin >> length;    
    
    int array[length];
    
    for (unsigned int i=0; i<length-1; i++) {
    	char input[6];
    	cin.getline(input, 6, ' ');
    	array[i] = atoi(input);
    }
    char input[6];
    cin.getline(input, 6);
    array[length-1] = atoi(input);
    
    
    int lastnotdone = length-1;
 
    
	while (lastnotdone > 0) {
	
		int max = 0;
		int max_i = 0;	
		for (int i=0; i<=lastnotdone; i++) {
			if (array[i] > max) {
				max = array[i];
				max_i = i;
			}
		}
		
		//cout << "max_i: " << max_i << " (value "<<array[max_i]<<")    lastnotdone: " << lastnotdone << "  ";
		
		
		if (max_i == lastnotdone) {
			//cout << '\n';
			//cout << "oikealla paikalla automaattisesti" << '\n';
			lastnotdone--;
			continue;
		}
		
		
		int temp;
		
		if (max_i != 0) {
			//cout << "suurin kärkeen" << '\n';
			//cout << "max_i/2: " << (max_i/2);
			for (int i=0; i<=max_i/2; i++) {
				temp = array[i];
				array[i] = array[max_i-i];
				array[max_i-i] = temp;
			}
			turns_oss << (max_i+1) << " ";
			turns_count++;
		}
		
		//cout << "suurin (" << max_i << ") kärjestä paikalleen ("<< lastnotdone <<")" << '\n';
		for (int i=0; i<=lastnotdone/2; i++) {
			temp = array[i];
			array[i] = array[lastnotdone-i];
			array[lastnotdone-i] = temp;
		}
 
		turns_oss << (lastnotdone+1) << " ";
		turns_count++;
		
		lastnotdone--;
		
		/*for (int i=0; i<length; i++) {
			cout << array[i] << " ";
		}
		cout << '\n';*/
		
	}
	
	
	
	cout << turns_count << '\n';
	cout << turns_oss.str() << endl;
	
	/*for (int i=0; i<length; i++) {
		cout << array[i] << " ";
	}*/
}
 
 
 
 
 
 

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED