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.

서브태스크 1 (22점)

This subtask has an additional constraint:

• $N \le 100$

서브태스크 2 (17점)

This subtask has an additional constraint:

• $N \le 2,000円$

서브태스크 3 (61점)

This subtask has no additional constraints.

힌트