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: Bump!
# | User | Rating |
---|---|---|
1 | tourist | 3843 |
2 | jiangly | 3705 |
3 | Benq | 3628 |
4 | orzdevinwang | 3571 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3530 |
8 | ecnerwala | 3499 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 163 |
3 | adamant | 162 |
4 | TheScrasse | 158 |
5 | nor | 153 |
5 | maroonrk | 153 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
9 | orz | 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: Bump!
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
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) |
Name |
---|