USACO Airplane Boarding Problem: Sol Using Segment Tree?
Difference between en1 and en2, changed 30 character(s)
[Problem Statement](http://www.usaco.org/index.php?page=viewproblem2&cpid=402)↵
↵
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!

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en5 English vamaddur 2017-09-12 08:13:15 8 Tiny change: '\n\nEDIT: Double Bump!' -> '\n\nEDIT: Triple Bump!'
en4 English vamaddur 2017-09-08 18:19:26 7 Tiny change: '\n\nEDIT: Bump!' -> '\n\nEDIT: Double Bump!'
en3 English vamaddur 2017-09-07 19:05:45 15 Tiny change: 'n advance!' -> 'n advance!\n\nEDIT: Bump!'
en2 English 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 English vamaddur 2017-09-04 20:19:11 323 Initial revision (published)