Envío 476

Código

import java.util.Scanner;
import java.util.Stack;

public class Main {

    public static long[] processLine(int N, Scanner myObj) {
        long elements[] = new long[N];
        for (int i=0; i < N; i++) {
            elements[i] = myObj.nextLong();
        }
        return elements;
    }

    public static long[] solve(int N, long[] elements) {
        long[] solution;
        Stack<Long> max;
        solution = new long[N];
        max = new Stack<Long>();
        for (int i = N-1; i >= 0; i--) {
            while (!max.empty() && elements[i] >= max.peek()) {
                max.pop();
            }
            solution[i] = max.empty() ? -1 : max.peek();
            max.push(new Long(elements[i]));
        }
        return solution;
    }

    public static void printCase(int i, long[] solution) {
        System.out.print("Case #" + i + ":");
        for (long e: solution) {
            System.out.print(" " + e);
        }
        System.out.println("");
    }

    public static void main(String ...args) {
        int N, C;
        long[] elements, solution;
        Scanner myObj = new Scanner(System.in);
        C = myObj.nextInt();
        for(int i=1; i<=C; i++) {
            N = myObj.nextInt();
            elements = processLine(N, myObj);
            solution = solve(N, elements);
            printCase(i, solution);
        }    
    }
}