Järjestys

import java.util.Arrays;
import java.util.Scanner;
import java.util.TreeMap;
import java.util.TreeSet;

public class Teht4 {

    public static void main(String[] args) {

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

        for (int i = 0; i < t.length; i++) {
            x[i] = Integer.parseInt(t[i]);
        }

        for (int i = 0; i < x.length; i++) {

            b.add(x[i]);
            z[x[i] - 1] = (i + 1) - (b.size() - (Arrays.binarySearch(b.toArray(), x[i]) + 1));

//            (b.headSet(x[i]).size() + 1)
            
//            c.put(x[i], 0);
//            c.replace(x[i], (i + 1) - (c.size() - c.;
            
        }
        
//        for (int i = c.size() - 1; i > 0; i--) {
//
//            op.append(c.get(i));
//            op.append(" ");
//            op.append(i + 1);
//            op.append(" ");
//            op.append(Math.max((i), 1));
//            op.append(" ");
//            op.append(Math.max((c.get(i) - 1), 1));
//            op.append(" ");
//
//        }

        for (int i = z.length - 1; i > 0; i--) {

            op.append(z[i]);
            op.append(" ");
            op.append(i + 1);
            op.append(" ");
            op.append(Math.max((i), 1));
            op.append(" ");
            op.append(Math.max((z[i] - 1), 1));
            op.append(" ");

        }

        System.out.println((x.length * 4) - 4);
        System.out.println(op);

    }
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED