Envío 2342

Código

from collections import deque

cases = int(input())

for case in range(cases):
	n = input()
	buildings = [int(v) for v in input().split(" ")]
	
	result = []
	stack = deque([buildings[-1]])

	for building in buildings[::-1]:
		# print(f"building {building}, stack {stack}, top {stack[-1]}", building, stack)
		
		if len(stack) > 0 and building < stack[-1]:
			result.insert(0, stack[-1])
			stack.append(building)
		else:
			
			while len(stack) > 0 and building >= stack[-1]:
				stack.pop()

			if len(stack) > 0 and building < stack[-1]:
				result.insert(0, stack[-1])
			if len(stack) == 0:
				result.insert(0, -1)

			stack.append(building)

		# print(f"result: {result}")

	str_result = ""
	for building in result:
		str_result += str(building) + " "

	print(f"Case #{case+1}: {str_result}")

"""
3
10
4 2 1 6 3 2 5 3 1 4
3
1 1 2
6
3 3 2 2 1 1
"""


"""
1
3
1 1 2

1
10
4 2 1 6 3 2 5 3 1 4
"""