Envío 6282

Código

import java.util.HashMap;
import java.util.Scanner;

public class Main {

    private static HashMap<Integer, Integer> memoization = new HashMap<Integer, Integer>();

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int casosDePrueba = scanner.nextInt();
        for(int caso=1; caso<=casosDePrueba; caso++){
            int n = scanner.nextInt();
            int[] array = new int[n];
            for(int i=0; i<n; i++){
                array[i]=scanner.nextInt();
            }

            findMaxSuffixArray(0, array);

            StringBuilder stringBuilder = new StringBuilder();
            stringBuilder.append("Case #" + caso +":");

            for(int i=0; i<n; i++){
                int value = array[i];
                for (int j=i+1; j<=n; j++){
                    if(j == n){
                        stringBuilder.append(" -1");
                    } else {
                        int horizon = array[j];
                        if(horizon > value){
                            stringBuilder.append(" " +horizon);
                            break;
                        }
                    }
                }
            }

            System.out.println(stringBuilder);
        }
    }