Hi i want to know is it possible to calculative range minimum/maximum query with BIT?
If yes then how??
And is its code shorter than segment tree for RMQ??
please help as it would be easy to write short codes during contest .Thanx :)
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Hi i want to know is it possible to calculative range minimum/maximum query with BIT?
If yes then how??
And is its code shorter than segment tree for RMQ??
please help as it would be easy to write short codes during contest .Thanx :)
Name |
---|
there is short code for RMQ
const int N = 1 << 17; // has to be power of 2
— this condition in your code is required only for non-commutative operations. Andmin
is of course commutative. My recent submission with this approach 8125739 — AC.