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 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
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.