Slimes
There are $$$n$$$ slimes placed in a line. The slimes are numbered from $$$1$$$ to $$$n$$$ in order from left to right. The size of the $$$i$$$-th slime is $$$a_i$$$.Every second, the following happens: exactly one slime eats one of its neighbors and increases its size by the eaten neighbor's size. A slime can eat its neighbor only if it is strictly bigger than this neighbor. If there is no slime which is strictly bigger than one of its neighbors, the process ends.For example, suppose $$$n = 5$$$, $$$a = [2, 2, 3, 1, 4]$$$. The process can go as follows:  first, the $$$3$$$-rd slime eats the $$$2$$$-nd slime. The size of the $$$3$$$-rd slime becomes $$$5$$$, the $$$2$$$-nd slime is eaten.  then, the $$$3$$$-rd slime eats the $$$1$$$-st slime (they are neighbors since the $$$2$$$-nd slime is already eaten). The size of the $$$3$$$-rd slime becomes $$$7$$$, the $$$1$$$-st slime is eaten.  then, the $$$5$$$-th slime eats the $$$4$$$-th slime. The size of the $$$5$$$-th slime becomes $$$5$$$, the $$$4$$$-th slime is eaten.  then, the $$$3$$$-rd slime eats the $$$5$$$-th slime (they are neighbors since the $$$4$$$-th slime is already eaten). The size of the $$$3$$$-rd slime becomes $$$12$$$, the $$$5$$$-th slime is eaten. For each slime, calculate the minimum number of seconds it takes for this slime to be eaten by another slime (among all possible ways the process can go), or report that it is impossible.
The first line contains a single integer $$$t$$$ ($$$1 \le t \le 10^4$$$) — the number of test cases.The first line of each test case contains a single integer $$$n$$$ ($$$1 \le n \le 3 \cdot 10^5$$$) — the number of slimes.The second line contains $$$n$$$ integers $$$a_1, a_2, \dots, a_n$$$ ($$$1 \le a_i \le 10^9$$$).The sum of $$$n$$$ over all test cases doesn't exceed $$$3 \cdot 10^5$$$.
For each test case, print $$$n$$$ integers. The $$$i$$$-th integer should be equal to the minimum number of seconds it takes for the $$$i$$$-th slime to be eaten by another slime or -1 if it is impossible.
import bisect

def solve():
    n = int(input())
    arr = list(map(int, input().split()))
    pref = [arr[i] for i in range(n)]
    for i in range(1, n):
        pref[i] += pref[i - 1]
    ind = -1
    ans = [10 ** 9 for i in range(n)]
    for i in range(n):
        curr = pref[i] - 2 * arr[i]
        ind1 = bisect.bisect_left(pref, curr)
        ind = min(ind, ind1)
        if ind >= 0 and curr > 0:
            ans[i] = i - ind
        if i - 1 >= 0 and arr[i] != arr[i - 1]:
            if arr[i] < arr[i - 1]:
                ans[i] = 1
            ind = i
    ind = n
    for i in range(n - 1, -1, -1):
        curr = pref[i] + arr[i] + 1
        ind1 = bisect.bisect_left(pref, curr)
        ind = max(ind, ind1)
        if ind < n and curr <= pref[-1]:
            ans[i] = min(ans[i], ind - i)
        if i + 1 < n and arr[i] != arr[i + 1]:
            if arr[i] < arr[i + 1]:
                ans[i] = 1
            ind = i
    for i in range(n):
        if ans[i] == 10 ** 9:
            ans[i] = -1
    print(*ans)
for _ in range(int(input())):
    solve()
import sys
input = lambda : sys.stdin.readline()
from bisect import bisect
for _ in range(int(input())):
    n = int(input())
    arr = list(map(int, input().split()))

    def solve(arr):
        ans = [1 << 32] * n
        pref = [0] * (n + 1)
        next = list(range(1, n + 2))
        for i in range(n):
            pref[i + 1] = pref[i] + arr[i]
        for i in range(n - 1, 0, -1):
            if arr[i - 1] == arr[i]:
                next[i] = next[i + 1]
        for i in range(n - 1, 0, -1):
            pos = max(next[i + 1], bisect(pref, pref[i] + arr[i - 1]))
            if pos <= n:
                ans[i - 1] = pos - i
            if arr[i - 1] > arr[i]:
                ans[i] = 1
        return ans
    ans1 = solve(arr)
    ans2 = solve(arr[::-1])[::-1]
    ans = [min(x, y) if min(x, y) < 1 << 32 else -1 for (x, y) in zip(ans1, ans2)]
    print(*ans)
import sys
input = lambda : sys.stdin.readline()
from bisect import bisect
for _ in range(int(input())):
    n = int(input())
    arr = list(map(int, input().split()))

    def solve(arr):
        ans = [1 << 32] * n
        pref = [0] * (n + 1)
        next = list(range(1, n + 2))
        for i in range(n):
            pref[i + 1] = pref[i] + arr[i]
        for i in range(n - 1, 0, -1):
            if arr[i - 1] == arr[i]:
                next[i] = next[i + 1]
        for i in range(n - 1, 0, -1):
            pos = max(next[i + 1], bisect(pref, pref[i] + arr[i - 1]))
            if pos <= n:
                ans[i - 1] = pos - i
            if arr[i - 1] > arr[i]:
                ans[i] = 1
        return ans
    ans1 = solve(arr)
    ans2 = solve(arr[::-1])[::-1]
    ans = [min(x, y) if min(x, y) < 1 << 32 else -1 for (x, y) in zip(ans1, ans2)]
    print(*ans)