Envío 3642

Código

def looking_to_the_horizon_no_stack(array, n):
    result = [-1 for _ in range(n)]
    tallest_and_nearest_building_height = array[n - 1]
    previous_building_height = array[n - 1]

    for building_idx in reversed(range(n - 1)):
        current_building_height = array[building_idx]
        if current_building_height >= previous_building_height and current_building_height >= tallest_and_nearest_building_height:
            tallest_and_nearest_building_height = current_building_height
        else:
            result[building_idx] = tallest_and_nearest_building_height
        previous_building_height = 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_no_stack(array, array_size)))))