Sorry peoples I don't usually post something like my code giving RTE please fix that but this time I am asking help for this.I have tried segment tree implementation many times but never got sucess.I request if anybody can take a glance at my code and point out what's going bad...My code link
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3803 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3627 |
| 4 | ecnerwala | 3584 |
| 5 | orzdevinwang | 3573 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | Radewoosh | 3542 |
| 9 | jqdai0815 | 3532 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 164 |
| 2 | awoo | 163 |
| 3 | adamant | 162 |
| 4 | maroonrk | 152 |
| 5 | -is-this-fft- | 151 |
| 6 | nor | 150 |
| 7 | atcoder_official | 147 |
| 8 | TheScrasse | 146 |
| 9 | Petr | 145 |
| 10 | SecondThread | 142 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 03.07.2024 13:53:34 (k2).
Десктопная версия, переключиться на мобильную.
При поддержке
segment tree needs 4 times the size of the normal array but the memory you took is even less than tree times the size of the normal array i didn't look much but this is definitly a bug
Why does it need 4 times the size? I usually allocate twice the nearest power of 2 for Segment Tree. Formally, if the array has n elements, then I allocate 2x + 1 for the Segment Tree, where x is the minimum integer such that 2x ≥ n.
it actually needs three times the size but i see everyone using 4 * Maxn so i thought that consider this the number of nodes being 2 ^ n + 2 -> 3 * 2 ^ n would be the maximum number thus 3 times the size but all people's segment trees aren't the same so yours can take less
Bugs I found: - On line 18 you are missing one case, re-check your logic - On line 41 you forgot to type "return" - Even after correcting line 41, your query function will end up in an infinite recursion, because you may call the function to a non-valid interval [low; high] and in this case your program never stops. Try to handle this case separately