Järjestys

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;
 
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);
        
        ArrayList<Integer> reversals = new ArrayList<>();
        
        for(int i = array.length - 1; i > 0; i--){
            int nextNum = sortedArray[i];
            int nextNumIndex = 0;
            for (int j = 0; j <= i; j++) {
                if(array[j] == nextNum){
                    nextNumIndex = j;
                    break;
                }
            }
            
            if(nextNumIndex != 0){
                reverse(array, nextNumIndex);
                reversals.add(nextNumIndex);
            }
            reverse(array, i);
            reversals.add(i);
        }
        
        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 k){
        int min = 0;
        int max = k;
        while(min < max){
            int temp = array[min];
            array[min] = array[max];
            array[max] = temp;
            min++;
            max--;
        }
    }
 
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED