Envío 6346

Código

import java.util.AbstractMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Stack;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int c = scanner.nextInt();
        for(int i=0; i<c; i++){
            int n = scanner.nextInt();
            int[] buildings = new int[n];
            int[] buildingsResults = new int[n];

            for(int j=0; j<buildings.length; j++){
                buildings[j]=scanner.nextInt();
                buildingsResults[j] = -1;
            }

            Stack<Map.Entry<Integer, Integer>> stack = new Stack<>();

            for(int j=0; j<buildings.length; j++){
                Map.Entry<Integer, Integer> value = new AbstractMap.SimpleEntry<>(j, buildings[j]);

                while (!stack.isEmpty() && stack.peek().getValue() < buildings[j]){
                    Map.Entry<Integer, Integer> stackedValue = stack.pop();
                    buildingsResults[stackedValue.getKey()] = buildings[j];
                }

                stack.add(value);
            }

            System.out.print("Case #" +(i+1) +": ");
            for(int j=0; j<buildingsResults.length; j++){
                if(j == buildings.length-1){
                    System.out.print(buildingsResults[j]);
                }
                System.out.print(buildingsResults[j] + " ");
            }
        }
    }
}