Constant Subsequence

Alice has an array $A$ of length $N$, and her goal is to rearrange the array in a way that minimises the maximum subarray sum of the resulting array. However, Alice must keep the relative order of all non-negative and negative elements the same as in the original array. In other words: - The non-negative numbers should appear in the same order as they originally appeared in $A$. - The negative nu