Fair Reading Load — Solution & Editorial

Back to the Problem

Identical to the shipping problem: binary search the load limit; greedily cut a new block when the running sum would exceed it.

Complexity: O(N log(sum))