I was wondering if there is a possible solution that uses a segment tree rather than a BBST, as I find that segment trees are easier to implement.
Please help, and thanks in advance!
# | User | Rating |
---|---|---|
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 |
# | User | Contrib. |
---|---|---|
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 |
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, as I find that segment trees are easier to implement.
Please help, and thanks in advance!
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 |
---|