Järjestys

import java.util.Scanner;
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();      
        TreeSet<Integer> b = new TreeSet<>();
        int[] z = new int[n];
        
        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() - (b.headSet(x[i]).size() + 1));
            
//            k(op, (i + 1) - b.headSet(x[i]).size(), i + 1);

//            if (!b.contains(x[i])) {
//                b.add(x[i]);
//            }
//            (b.headSet(x[i]).size() + 1)
            
        }
        
        for (int i = z.length - 1; i > 0; i--) {
//            System.out.println(" ** " + (i + 1) + " = " + z[i]);
            k(op, z[i], i + 1);
        }
        
        System.out.println((x.length * 4) - 4);
        System.out.println(op);
        
    }
    
    public static void k(StringBuilder s, int x, int l) {
        
//        String a = x + " " + l + " " + Math.max((l - 1), 1) + " " + Math.max((x - 1), 1) + " ";
        
//        StringBuilder y = new StringBuilder(x + " " + l + " " + Math.max((l - 1), 1) + " " + Math.max((x - 1), 1) + " ");
//        
        s.append(x);
        s.append(" ");
        s.append(l);
        s.append(" ");
        s.append(Math.max((l - 1), 1));
        s.append(" ");
        s.append(Math.max((x - 1), 1));
        s.append(" ");
        
//        s.append(a);
        
    }
    
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED