Given an Array N unique elements ,and some elements may contain values greater than N.
For ex: 1, 8, 2147483647
To work on Fenwick Tree, we need to adjust that to a 1 — N range. Is there a way to do this ?
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 152 |
| 3 | Proof_by_QED | 146 |
| 3 | Um_nik | 146 |
| 5 | Dominater069 | 144 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
Given an Array N unique elements ,and some elements may contain values greater than N.
For ex: 1, 8, 2147483647
To work on Fenwick Tree, we need to adjust that to a 1 — N range. Is there a way to do this ?
| Name |
|---|



Sort the values, then map each value to its position in the sorted array.
can you give code example.
I've solved problem C on last contest using this approach
My code
You can write Fenwick Tree on map( O(logMAX*logMAX) ).
use co-ordinate compression.