Järjestys

import java.util.*;
import java.util.regex.Pattern;
 
 
public class Jarjestys {
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		
		int turns_count = 0;
		String turns = "";
		int length = Integer.valueOf(scanner.nextLine());
		
		Integer[] array = new Integer[length];
		
		int index = 0;
		for (String s : scanner.nextLine().split(" ")) {
			int value = Integer.valueOf(s);
			array[index] = value;
			index++;
		}
		
		Random rand = new Random();
		while (!isOrdered(array)) {
			int turn_n = rand.nextInt((length - 1) + 2);
			array = turn(array, turn_n);
			
			turns_count++;
			turns += " " + Integer.toString(turn_n);
		}		
		
		
		System.out.println(turns_count);
		System.out.println(turns.substring(1));
		
	}
	
	
	public static Integer[] turn(Integer[] arr, int n) {
		Integer[] n_arr = new Integer[arr.length];
		for (int i=0; i<arr.length; i++) {
			if (i<n) {
				n_arr[n-i-1] = arr[i];
			} else {
				n_arr[i] = arr[i];
			}
		}
		return n_arr;
	}
	
	public static boolean isOrdered(Integer[] arr) {
		for (int i=1; i<arr.length-1; i++) {
			if (arr[i-1] >= arr[i]) {
				return false;
			}
		}
		return true;
	}
}

Test 1

Group: 1

Verdict: TIME LIMIT EXCEEDED

Test 2

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED