Use a sorted data structure to collect removal points and store the segments.

Use a heap or priority queue to store segment sums and their corresponding boundaries.

Make sure to remove invalid segments from the heap.