Envío 1388

Código

import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int c = sc.nextInt();

        for(int j = 0;j<c;j++){
            int N = sc.nextInt();
            int []array = new int[N];
            int []solve= new int[N];
            for(int i = 0;i<N;i++)
            {
                array[i] = sc.nextInt();
            }

            Queue<Integer> l = new LinkedList<>();
            for(int i = N-1;i>=0;i--){
                if(l.size() > 0 ){
                    while(!l.isEmpty() && array[i] >= l.peek()){
                        l.poll();
                    }

                    if(l.size() == 0){
                        solve[i] = -1;
                        l.offer(array[i]);
                    }else{
                        solve[i] = l.peek();
                        l.offer(array[i]);
                    }

                }else{
                    solve[i] = -1;
                    l.offer(array[i]);
                }

            }

            System.out.print("Case #" + (j+1) + ":");
            for(int i = 0;i<N;i++)
                System.out.print(" " + solve[i]);

            System.out.println();

        }
    }
}