Envío 3629

Código

from collections import deque


def looking_to_the_horizon(array, n):
    tallest_and_nearest_building_height = -1
    prev_building_height = array[n - 1]

    stack = deque(maxlen=n)
    stack.append(tallest_and_nearest_building_height)

    for i in reversed(range(n - 1)):
        current_building_height = array[i]

        if current_building_height < prev_building_height:
            tallest_and_nearest_building_height = prev_building_height
            stack.append(tallest_and_nearest_building_height)
        
        elif current_building_height > prev_building_height and current_building_height > tallest_and_nearest_building_height:
            tallest_and_nearest_building_height = current_building_height
            stack.append(-1)

        else:
            if current_building_height == tallest_and_nearest_building_height:
                stack.append(-1)
            else:
                stack.append(tallest_and_nearest_building_height)
        
        prev_building_height = current_building_height

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