Järjestys

//import java.util.Scanner;
//import java.util.Arrays;
//import java.util.ArrayList;
public class jarjestys {

    //ArrayList<Integer> turns;
    public static void main (String[] args) {
        Jarjestys();
    }

    public static void Jarjestys() {
        //Scanner scanner = new Scanner(System.in);
        IO io = new IO();
        int a = io.nextInt();//scanner.nextInt();
        //int a = scanner.nextInt();
        int y;
        int[] nums = new int[a];
//        ArrayList<Integer> turns = new ArrayList<Integer>();
        for (int j = 0; j < a; j++) {
            nums[j] = io.nextInt();//scanner.nextInt();
            //nums[j] = scanner.nextInt();
        }
//        System.out.println(2*a);
        io.println(2*a);
        for (int i = a; i >= 1; i--) {
            nums = findLargest(nums, i);
            /*
            //System.out.println("FL RES: " + findLargest(nums, i));
            y = findLargest(nums, i);
            if (y + 1 != i) {
           //     System.out.println("y: " + y + "preflip1:" + Arrays.toString(nums));
                flip(nums, y);
            //      System.out.println("y: " + y + "afterflip1:" + Arrays.toString(nums));
                turns.add(y+1);
                y = nums.length - a + i - 1;
                flip(nums, y);
         //       System.out.println("x: " + x + "afterflip2" + Arrays.toString(nums));
                turns.add(y+1);
                //System.out.println(Arrays.toString(nums));
                */
        }
       /* 
        //System.out.println(turns.size());
        //io.println(turns.size());
        //System.out.println(Arrays.toString(turns.toArray()));
        for (int i = 0; i < turns.size(); i++) {
            System.out.print(turns.get(i) + " ");
            //io.print(turns.get(i) + " ");
        }
        //io.close();
        //*/

    }
    private static int[] findLargest(int[] array, int toSearch) { //returns indexOf(largest)
        //System.out.println(toSearch);
        IO io = new IO();
        int[] temp = new int[toSearch];
        int i = 0;
        int count = 0;
        int count2 = 0;
        for(i = 0; i < toSearch; i++) {
            if (array[i] == toSearch) {
                //print toSeearch loc, i + 1
                int index = i + 1;
                //System.out.print(index + " ");
                io.print(index + " ");
                //print toSearch
                //System.out.print(toSearch + " ");
                io.print(toSearch + " ");
                for (int k = toSearch - 1; k > i; k--) {
                    temp[count] = array[k];
                    count++;
                }
                for (int j = count; j < toSearch - 1; j++) {
                    temp[j] = array[count2];
                    count2++;
                }
                return temp;
            }
        }
        /*
        return -1;
        */
        return new int[1];
    }
    /*
    private static void flip(int[] array, int toFlip) {
        //System.out.println(toFlip);
        int[] temp = Arrays.copyOfRange(array, 0, toFlip + 1); //-1??
        //System.out.println("TEMP:" + Arrays.toString(temp));
        for(int i = 0; i <= toFlip; i++) {
            //System.out.println(toFlip-i-1);
            array[toFlip-i] = temp[i];
        }
    }
    */
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED