19321번 - Longest Increasing Subsequence 스페셜 저지다국어

Given $f_1, f_2, \ldots, f_n$, find a permutation $p_1, p_2, \ldots, p_n$ of integers $1, 2, \ldots, n$ such that, for each $i$, the length of the longest strictly increasing subsequence ending with $p_i$ is $f_i$.

The first line contains an integer $n$ ($1 \leq n \leq 10^5$).

The second line contains $n$ integers $f_1, f_2, \ldots, f_n$ ($1 \leq f_i \leq n$). It is guaranteed that, for the given input, at least one such permutation $p_1, p_2, \ldots, p_n$ exists.

On the first line, print $n$ integers $p_1, p_2, \ldots, p_n$. These numbers must form a permutation of integers $1, 2, \ldots, n$. If there are several possible answers, print any one of them.