Minimise Maximum Subarray Sum

You are given two positive integers $X$ and $Y$. Consider an array $A$ consisting of $X$ occurrences of $1$ and $Y$ occurrences of $-2$. You can rearrange the elements of $A$ in any order. Rearrange the elements to **minimize** the maximum sum over all subarrays of $A$. Find the maximum subarray sum of such rearrangement of $A$. ### Input - The first line contains a single integer $T$, den