Envío 3627

Código

from collections import deque


def looking_to_the_horizon(array, n):
    stack = deque(maxlen=n)
    stack.append(-1)
    tallest_building = array[n - 1]

    for i in reversed(range(n - 1)):
        current_building_height = array[i]
        if current_building_height >= tallest_building:
            stack.append(-1)
            tallest_building = current_building_height
        else:
            stack.append(tallest_building)

    return list(reversed(stack))


number_of_cases = int(input())
for i in range(number_of_cases):
    array_size = int(input())
    array = [int(x) for x in input().split()]
    print("Case #{0}: {1}".format(i + 1, ' '.join(map(str, looking_to_the_horizon(array, array_size)))))