Järjestys

import java.util.*;
 
public class Jarjestys {
 
    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]);
        }
 
        int[] sortedArray = Arrays.copyOf(array, array.length);
        Arrays.sort(sortedArray);
 
        int startIndex = 0;
        int stopIndex = array.length - 1;
        int step = 1;
        List<Integer> reversals = new ArrayList<>();
 
        while (startIndex != stopIndex) {
 
            boolean traverseBackWards = startIndex > stopIndex;
            int maxIndex = traverseBackWards ? startIndex : stopIndex;
            int minIndex = traverseBackWards ? stopIndex : startIndex;
 
            int currentNumber = sortedArray[Math.abs(startIndex - stopIndex)];
            int currentNumberIndex = 0;
 
            for (int i = minIndex; i <= maxIndex; i++) {
                if (array[i] == currentNumber) {
                    currentNumberIndex = i;
                    break;
                }
            }
 
            if (currentNumberIndex == stopIndex) {
                if (traverseBackWards) {
                    stopIndex++;
                } else {
                    stopIndex--;
                }
                continue;
            }
 
            if (currentNumberIndex != startIndex) {
                if (traverseBackWards) {
                    reverse(array, currentNumberIndex, startIndex);
                    reversals.add(startIndex - currentNumberIndex + 1);
                } else {
                    reverse(array, startIndex, currentNumberIndex);
                    reversals.add(currentNumberIndex - startIndex + 1);
                }
            }
 
            if (traverseBackWards) {
                reversals.add(startIndex - stopIndex + 1);
 
                int temp = startIndex;
                startIndex = stopIndex;
                stopIndex = temp - 1;
 
            } else {
                reversals.add(stopIndex - startIndex + 1);
 
                int temp = startIndex;
                startIndex = stopIndex;
                stopIndex = temp + 1;
 
            }
 
        }
 
        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 void reverse(int[] array, int startIndex, int stopIndex) {
 
        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