Recently I came across this blog Efficient and Easy segment trees. After reading this I felt that the normal implementation with 5 arguments is easier to understand and implement(in my opinion). I want to know which of the implementations of segment-tree is better so that if the one written in the blog is better I will try to learn it. (better in the sense that it can be easily be applied in some new question)
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 154 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 146 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 133 |
| 10 | cry | 130 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 10.11.2026 22:07:43 (g2).
Десктопная версия, переключиться на мобильную.
При поддержке
Auto comment: topic has been updated by DCSekhara (previous revision, new revision, compare).
There isn't a "perfect" implementation of a Segment Tree. It's all based on what you prefer and are comfortable with. I prefer recursive Segment Trees over iterative because while iterative Segment Trees are shorter to code, recursive ones are easier to understand and modify at least for me.
If I was looking for an implementation I could easily modify and adapt to solve new different questions, personally I would use the recursive implementation.
thanks. I too personally feel the same. But since the blog is written by a red-coder I doubted myself