Express a_i via first element and differences d_i = a_i - a_{i-1}. Sliding window sums give linear constraints on differences.

Whole array determined up to one additive degree of freedom. Range max depends on cumulative sum of differences within that range.

"Unbounded" when query range doesn't intersect every sliding window — some elements isolated from constraints can be driven arbitrarily negative.