Can we solve spoj MULTQ3 using BIT? If yes then How?
№ | Пользователь | Рейтинг |
---|---|---|
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 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
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 |
Can we solve spoj MULTQ3 using BIT? If yes then How?
Название |
---|
I think you can't do this problem with a BIT, because you have to do intervals update. But you can try with a segment tree with lazy propagation.
Oh, I haven't thought using
BIT
. This problem I useSegment Tree
.If you haven't solve this problem with Segment Tree, you can go this link1 and link2 to know about
Segment Tree
And this is my solution.
If you want to continue with thinking of using BIT, I will prevent you. Hope you can do this.