I was wondering if there is a possible solution that uses a segment tree rather than a BBST (balanced binary search tree), as I find that segment trees are easier to implement.
Please help, and thanks in advance!
EDIT: Triple Bump!
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3845 |
2 | jiangly | 3707 |
3 | Benq | 3630 |
4 | orzdevinwang | 3573 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3532 |
8 | ecnerwala | 3501 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 163 |
3 | awoo | 161 |
4 | nor | 152 |
5 | maroonrk | 151 |
5 | -is-this-fft- | 151 |
7 | TheScrasse | 148 |
8 | atcoder_official | 146 |
9 | Petr | 145 |
10 | pajenegod | 144 |
USACO Airplane Boarding Problem: Sol Using Segment Tree?
I was wondering if there is a possible solution that uses a segment tree rather than a BBST (balanced binary search tree), as I find that segment trees are easier to implement.
Please help, and thanks in advance!
EDIT: Triple Bump!
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en5 |
![]() |
vamaddur | 2017-09-12 08:13:15 | 8 | Tiny change: '\n\nEDIT: Double Bump!' -> '\n\nEDIT: Triple Bump!' | |
en4 |
![]() |
vamaddur | 2017-09-08 18:19:26 | 7 | Tiny change: '\n\nEDIT: Bump!' -> '\n\nEDIT: Double Bump!' | |
en3 |
![]() |
vamaddur | 2017-09-07 19:05:45 | 15 | Tiny change: 'n advance!' -> 'n advance!\n\nEDIT: Bump!' | |
en2 |
![]() |
vamaddur | 2017-09-05 15:30:51 | 30 | Tiny change: 'han a BBST, as I fin' -> 'han a BBST (balanced binary search tree), as I fin' | |
en1 |
![]() |
vamaddur | 2017-09-04 20:19:11 | 323 | Initial revision (published) |
Название |
---|