## Problem Houses lie in a line. `values[i]` is the nonnegative payment for delivering to house `i`. Two delivery robots are available. Robot one can serve at most `c1` consecutive houses, and robot two can serve at most `c2` consecutive houses. Their routes must not overlap. Implement `max_delivery_revenue(values, c1, c2)` and return the maximum total payment. A robot may serve fewer than its capacity, and a robot with zero capacity serves no houses. ## Constraints - `1 <= len(values) <= 200,000` - `0 <= values[i] <= 10^9` - `0 <= c1, c2 <= len(values)` - Each chosen route is one contiguous segment. - The answer may exceed 32-bit range. ## Examples `values = [4, 2, 3, 5]`, `c1 = 2`, `c2 = 1` returns `12`. One robot serves `[3, 5]` and the other serves `[4]`. `values = [8, 1, 1]`, `c1 = 1`, `c2 = 1` returns `9`. ## Clarifications The robots may appear in either left-to-right order. Because payments are nonnegative, using fewer than the available capacity is only useful when boundaries or the other route prevent a longer segment. ## Hint Precompute the best bounded-length route available entirely to the left and entirely to the right of each split. Evaluate both assignments of capacities to the two sides. ## Interview Follow-ups - Return both selected route ranges. - Generalize to `k` robots with different capacities. - Discuss the change when house payments may be negative.