Core Idea
The answer is the largest allowed segment sum. If a limit x works, then any larger limit also works.
Algorithm
Binary search the limit. For a fixed limit, greedily extend the current segment until adding the next value would exceed the limit, then start a new segment.
Common Mistakes
The lower bound is the maximum single element because every element must fit somewhere. The upper bound is the total array sum.