Järjestys

import java.util.Arrays;
import java.util.Scanner;

public class Jarjestys {

	public static void main(String[] args) {

		Scanner reader = new Scanner(System.in);
		int loop = reader.nextInt();

		int[] numbers = new int[loop];
		int i = 0;
		for (i=0;i<loop;i++) {
			numbers[i] = reader.nextInt() - 1;
		}
		int[] sortOrder = sortArray(numbers);
		int maara = 0;
		for (int num : sortOrder)
			if (num > 0)
				maara++;
		System.out.println(maara);
		//String str = "";
		for (int num : sortOrder)
			if (num > 0)
				System.out.print((num + 1) + " "); //Hoping this works
		//str = str.trim();
		//System.out.println(str);
		System.out.print("\n");
		reader.close();

	}

	private static int[] sortArray(int[] array) {
		int[] sortedArray = array.clone();
		Arrays.parallelSort(sortedArray);
		int[] sortOrder = new int[5*array.length];
		int i, j=0;
		int value = 1;
		while (checkIfSorted(array, sortedArray) != -1) {
			for (i=0;i<array.length;i++) {
				if (array[i] == array.length - value) {
					if (i == array.length - value) {
						value++;
						break;
					}
					sortOrder[j++] = i;
					sortOrder[j++] = array.length - value;
					turn(array, i);
					turn(array, array.length - value++);
					break;
				}
			}
		}
		return sortOrder;
	}

	private static int checkIfSorted(int[] array, int[] sortedArray) {
		int i;
		for (i=0;i<array.length-1;i++) {
			if (array[i] != sortedArray[i])
				return i;
		}
		return -1;
	}

	private static void turn(int[] array, int index) {
		int[] orgArray = array.clone();
		for (int i=0;i<array.length;i++) {
			if (index - i >= 0)
				array[i] = orgArray[index-i];
			else
				break;
		}
	}
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED