3511. Make a Positive Array

Only check subarrays up to a specific size.

Find the subarrays containing between 3 and 5 elements with a non-positive total sum.

Use a greedy approach to assign certain indices the maximum value.

Start with the subarray with the smallest last index i. Replace the element at index i with the maximum value. Find the selected subarray with the next smallest last index j that does not contain index i. Replace the element at index j with the maximum value, and repeat this process until all non-positive subarrays are fixed.