求助过不了编

N = int(1e5 + 10)
INF = int(1e9 + 10)
L = [int(0) for i in range(N)]
R = [int(0) for i in range(N)]
t = [-INF for i in range(N)]
a = [int(0) for i in range(N)]

def Max(a, b):
    if a > b:
        return a
    return b

def cmp(a, b):
    if a[0] > b[0]:
        return a
    return b

def build(p, l, r):
    L[p] = int(l), R[p] = int(r)
    if l == r:
        t[p] = a[l]
        return
    mid = int((l + r) // 2)
    if l <= mid:
        build(p * 2, l, mid)
    if r > mid:
        build(p * 2 + 1, mid + 1, r)
    t[p] = Max(t[p * 2]. t[p * 2 + 1])

def change(p, x, v):
    if L[p] == R[p]:
        t[p] = v
        return
    mid = int((l + r) // 2)
    if x <= mid:
        change(p * 2, x, v)
    if x > mid:
        change(p * 2 + 1, x, v)
    t[p] = Max(t[p * 2], t[p * 2 + 1])

def ask(p, l, r):
    if l <= L[p] and r >= R[p]:
        return [t[p], p]
    mid = int((l + r) // 2)
    val = [-INF, p]
    if l <= mid:
        val = cmp(val, ask(p * 2, l, r))
    if r > mid:
        val = cmp(val, ask(p * 2 + 1, l, r))
    return val

n = int(input())
for i in range(n):
    b = input()
    a[i + 1] = int(b)
build(int(1), int(1), n)
ans = [int(0) for i in range(N)]
for i in range(n):
    val = ask(int(1), int(1), n)
    ans[i] = val[0], change(1, val[1], -INF)
for i in range(n):
    print(ans[i], end = ' ')
print("\n")