Envío 3631

Código

from collections import deque


def looking_to_the_horizon(array, n):
    result = [-1 for _ in range(n)]
    stack = deque(maxlen=n)

    for current_building_index, current_building_height in enumerate(array):
        while len(stack) > 0:
            # Get previous building info from the stack
            prev_building_index, prev_building_height = stack[len(stack) - 1]
            if prev_building_height < current_building_height:
                # If previous building height is lower than current building height, update results
                result[prev_building_index] = current_building_height
                stack.pop()
            else:
                break

        # Push the current building info to the stack
        stack.append((current_building_index, current_building_height))

    return result


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)))))