Järjestys

import java.util.ArrayList;
//import java.util.Arrays;
//import java.util.HashMap;
import java.util.Scanner;
//import java.util.TreeSet;
//import java.util.TreeMap;

public class Teht4 {

    public static void main(String[] args) {

        Scanner l = new Scanner(System.in);
        int n = l.nextInt();
//        String[] t = l.nextLine().split(" ");
        StringBuilder op = new StringBuilder();
        int[] x = new int[n];
        
//        int[] z = new int[n];
        
//        TreeSet<Integer> b = new TreeSet<>();
        ArrayList<Integer> a = new ArrayList<>();
//        HashMap<Integer, Integer> c = new HashMap<Integer, Integer>();
//        TreeMap<Integer, Integer> c = new TreeMap<>();

        for (int i = 0; i < n; i++) {
//            int o = Integer.parseInt(t[i]);
            int o = l.nextInt();
            a.add(o);
            x[o - 1] = i;
        }

        for (int i = n; i > 1; i--) {
            
            for (int j = x[i - 1]; j >= 0; j--) {
                
                j = Math.min(j, a.size() - 1);
                
                if (a.get(j) == i && j != (i - 1)) {
                    
                    if(j + 1 > 1) {
                        op.append(j + 1).append(" ");
                    }
                    
                    if (i > 1) {
                        op.append(i).append(" ");
                    }
                    
                    if(i - 1 > 1) {
                        op.append(i - 1).append(" ");
                    }
                    
                    if(j > 1) {
                        op.append(j).append(" ");
                    }
                    
                    a.remove(j);
                    
                }
                
            }
            
        }

        System.out.println(op.toString().split(" ").length);
        System.out.println(op);

    }
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED