Järjestys

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
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[] z = new int[n];
        
//        TreeSet<Integer> b = new TreeSet<>();
        ArrayList<Integer> c = new ArrayList<>();
//        HashMap<Integer, Integer> c = new HashMap<Integer, Integer>();
//        TreeMap<Integer, Integer> c = new TreeMap<>();
 
//        for (int i = 0; i < t.length; i++) {
//            int v = Integer.parseInt(t[i]);
//            
//            b.add(v);
//            z[v - 1] = (i + 1) - (b.size() - (Arrays.binarySearch(b.toArray(), v) + 1));
//        }
 
        
 
        for (int i = 0; i < n; i++) {
            Integer v = l.nextInt();
            
            c.add(v);
            Collections.sort(c);
            z[v - 1] = (i + 1) - (c.size() - (c.indexOf(v) + 1));
            
//            b.add(v);
//            z[v - 1] = (i + 1) - (b.size() - (Arrays.binarySearch(b.toArray(), v) + 1));
        }
 
        for (int i = z.length - 1; i > 0; i--) {
 
            op.append(z[i]).append(" ").append(i + 1).append(" ").append(Math.max(i, 1)).append(" ").append(Math.max((z[i] - 1), 1)).append(" ");
 
        }
 
        System.out.println((n * 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