Block Placement Queries
A segment tree stores each range’s free prefix, free suffix and longest free run, so a prefix query reads the longest gap in O(log n).
A segment tree stores each range’s free prefix, free suffix and longest free run, so a prefix query reads the longest gap in O(log n).