题解 | 栈和排序

#之前那个思路不太完善，不知道为什么通过了。
n = int(input())
p = list(map(int, input().split()))
pushed = []
popped = []
for ele in p:
    pushed.append(ele)
    if pushed[-1] == n:
        pushed.pop()
        popped.append(ele)
    else:
        if popped and pushed:
            while pushed[-1] == popped[-1] - 1:
                popped.append(pushed[-1])
                pushed.pop()
result = popped + pushed[::-1]
print(*result)