I solved it using segment tree. Can it be solved using BIT, Has anyone done that ?
http://www.spoj.pl/problems/BRCKTS/
http://www.spoj.pl/problems/BRCKTS/
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 156 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | nor | 152 |
Название |
---|
Can u tel me if I use segment tree to solve this question then on which basis should i build the tree..?
every node in the tree should have the what is its need of brackets. For example you can maintain a variable called balance for which you have the following:
balance = 0 — the interval to which the node corresponds is balanced balance = x (x>0) — the interval needs x closing brackets balance = x (x<0) — the interval needs x opening brackets
You should make the changes in the update function and your query function would simply check if the balance of the root is 0
Update: this balance thing should be implemented by separating the needs for every node this means that you must keep needOpening and needClosing for every node