Järjestys

#include <iostream>
#include <vector>

using namespace std;

void reverse(int * numbers, int startIndex, int stopIndex){
	while (startIndex < stopIndex){
		int temp = numbers[startIndex];
		numbers[startIndex] = numbers[stopIndex];
		numbers[stopIndex] = temp;
		startIndex++;
		stopIndex--;
	}
}

int main() {

	int n;
	cin >> n;

	int * numbers = new int[n];
	int maxNumber = n;
	int startIndex = 0;
	int stopIndex = n - 1;
	vector<int> reversals;

	for (int i = 0; i < n; i++){
		std::cin >> numbers[i];
	}

	while (startIndex != stopIndex){

		bool traverseBackwards = startIndex > stopIndex;
		int minIndex = traverseBackwards ? stopIndex : startIndex;
		int maxIndex = traverseBackwards ? startIndex : stopIndex;

		int currentNumber = maxNumber;
		int currentNumberIndex = 0;

		for (int i = minIndex; i <= maxIndex; ++i){
			if (numbers[i] == currentNumber){
				currentNumberIndex = i;
				break;
			}
		}

		if (currentNumberIndex == stopIndex) {
			if (traverseBackwards) {
				stopIndex++;
			}
			else {
				stopIndex--;
			}
			maxNumber--;
			continue;
		}

		if (currentNumberIndex != startIndex) {
			if (traverseBackwards) {
				reverse(numbers, currentNumberIndex, startIndex);
				reversals.push_back(startIndex - currentNumberIndex + 1);
			}
			else {
				reverse(numbers, startIndex, currentNumberIndex);
				reversals.push_back(currentNumberIndex - startIndex + 1);
			}
		}

		if (traverseBackwards) {
			reversals.push_back(startIndex - stopIndex + 1);

			int temp = startIndex;
			startIndex = stopIndex;
			stopIndex = temp - 1;
		}
		else {
			reversals.push_back(stopIndex - startIndex + 1);

			int temp = startIndex;
			startIndex = stopIndex;
			stopIndex = temp + 1;
		}
		maxNumber--;
	}

	cout << reversals.size() << endl;
	for (size_t i = 0; i < reversals.size(); ++i)
		cout << reversals[i] << " ";


}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED