Järjestys

#include <iostream>
#include <string.h>



int main() {
	
	int tableSize;
	std::cin >> tableSize;
	std::cin.get();
	int * table = new int[tableSize];
	for (int i = 0; i < tableSize; i++) {
		std::cin >> table[i];
	}
	std::cin.get();

	
	//cache initial position of each number
	int * positionCache;
	positionCache = new int[tableSize];
	for (int i = 0; i < tableSize; i++) {
		positionCache[table[i]-1] = i;
	}
	//numPositions[num-1] contains the position of num

	int * swaps = new int[1000000];
	int swapcount = 0;

	for (int i = 0; i < tableSize; i++) {
		int found = positionCache[tableSize - i - 1];
		if (found != 0) {
			found = found - (swapcount/3);
		}
		if (found != tableSize - 1 - i) {
			swaps[swapcount] = found + 1;
			swaps[swapcount + 1] = tableSize - i;
			swaps[swapcount + 2] = tableSize - i - 1;
			swapcount = swapcount + 3;
		}
	}


	std::cout << swapcount << "\n";
	for (int i = 0; i < swapcount; i++) {
		std::cout << swaps[i] << " ";
	}
	std::cout << "\n";



	std::cin.get();
	return 0;
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: WRONG ANSWER