17170번 - Increasing Sequence 서브태스크다국어

You are given a permutation of size $N$. For each $i$, print the number of indices $j \neq i$, which when removed, decreases the maximum possible length of an increasing subsequence that contains index $i$.

The first line contains an integer $N$.

The next line contains $N$ integers $A_1, A_2, \cdots, A_N$.

Print $N$ integers, separated by spaces, denoting the answers for $i = 1, 2, 3, \cdots, N$.

• $1 \leq N \leq 250\,000$
• $1 \le A_i \le N$
• Every element of $A$ is distinct.

This subtask has an additional constraint:

• $N \le 100$

This subtask has an additional constraint:

• $N \le 2\,000$

This subtask has no additional constraints.