We can add the first positive number to the beginning and the last positive number to the end so that any consecutive of -1s are surrounded by positive numbers.
提示 3
Suppose the answer is d, it can be proved that for the optimal case we'll replace -1s with values 0 < x <= y and it's always optimal to select x = min(a) + d. So we only need to select y.
