| antontrygubO_o UOI problems |
|---|
| Finished |
Given an array of integers $$$a$$$ of length $$$n$$$.
You can modify the array using the addition operation. To apply the addition operation, you need to perform three sequential actions:
Find the minimum number of addition operations required to make all elements of the array $$$a$$$ pairwise distinct.
The first line contains a single integer $$$n$$$ ($$$1 \le n \le 2 \cdot 10^5$$$) — the length of the array.
The second line contains $$$n$$$ integers $$$a_1,a_2,\ldots,a_n$$$ ($$$1 \le a_i \le 10^9$$$) — the elements of the array.
Output a single integer — the minimum number of addition operations required to make all elements of the array $$$a$$$ pairwise distinct.
3 1 2 3
0
5 2 3 2 3 2
2
9 2 3 1 1 3 2 1 3 3
2
In the first example, all elements of the array $$$a$$$ are pairwise distinct.
In the second example, after applying two addition operations with parameters $$$x=-3$$$, $$$l=1$$$, $$$r=2$$$ and $$$x=-1$$$, $$$l=1$$$, $$$r=3$$$, the array $$$a$$$ becomes equal to $$$[-2,-1,1,3,2]$$$.
In the third example, after applying two addition operations with parameters $$$x=-3$$$, $$$l=4$$$, $$$r=8$$$ and $$$x=-10$$$, $$$l=7$$$, $$$r=9$$$, the array $$$a$$$ becomes equal to $$$[2,3,1,-2,0,-1,-12,-10,-7]$$$.
| Name |
|---|


