Järjestys

import java.util.*;

public class Jarjestys7 {

    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);

        int n = Integer.parseInt(scanner.nextLine());
        String[] stringArray = scanner.nextLine().split(" ");
        int[] array = new int[stringArray.length];
        for (int i = 0; i < stringArray.length; i++) {
            array[i] = Integer.parseInt(stringArray[i]);
        }

        List<Integer> reversals = insertionSort(array);

        System.out.println(reversals.size());
        StringBuilder result = new StringBuilder();
        for (int i = 0; i < reversals.size(); i++) {
            result.append(reversals.get(i));
            if (i != reversals.size() - 1) {
                result.append(" ");
            }
        }
        System.out.println(result.toString());
    }

    private static List<Integer> insertionSort(int[] array) {

        List<Integer> reversals = new ArrayList<>();

        for (int i = 1; i < array.length; i++) {

            int index = getIndex(array, i - 1, array[i]);

            if (index == i) {
                continue;
            }

            if (index - 1 > 0) {
                reverse(array, index - 1);
                reversals.add(index);
            }
            if (i - 1 > 0) {
                reverse(array, i - 1);
                reversals.add(i);
            }
            reverse(array, i);
            reversals.add(i + 1);
            if (index > 0) {
                reverse(array, index);
                reversals.add(index + 1);
            }

        }

        return reversals;
    }

    private static int getIndex(int[] array, int high, int num) {

        int low = 0;

        if (num < array[0]) {
            return 0;
        }
        if (num > array[high]) {
            return high + 1;
        }

        while (true) {
            int middle = (low + high) / 2;

            if (array[middle] < num) {
                if (array[middle + 1] >= num) {
                    return middle + 1;
                }
                low = middle + 1;
            } else {
                if (array[middle - 1] <= num) {
                    return middle;
                }
                high = middle - 1;
            }
        }
    }

    private static void reverse(int[] array, int stopIndex) {
        int startIndex = 0;
        while (startIndex < stopIndex) {
            int temp = array[startIndex];
            array[startIndex] = array[stopIndex];
            array[stopIndex] = temp;
            startIndex++;
            stopIndex--;
        }
    }

}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED