Longest Alternating Subarray

You are given a 0-indexed array of integers ‘NUMS’ of length ‘N’. For each index ‘i’ ( i >=0 & i < ‘N’ ) find the length of the longest subarray starting from ‘i’.

Alternating subarray is a subarray in which the adjacent numbers are of different signs.

Example:

Input: ‘N’ = 5,  ‘NUMS’ = {-1, 2, 3, -5, 2}.

Output: {2, 1, 3, 2, 1}.

The longest alternating subarray starting from index 0 is -1, 2.
The longest alternating subarray starting from index 1 is 2.
The longest alternating subarray starting from index 2 is 3, -5 2.
The longest alternating subarray starting from index 3 is -5, 2.
The longest alternating subarray starting from index 4 is 2.
Hence, the final output array is {2, 1, 3, 2, 1}.

Input Format :

The first line will contain the integer 'T', denoting the number of test cases.

The first line of each test case contains an integer ‘N’ denoting the length of the array ‘NUMS. 

The second line of each test case contains ‘N’ space-separated integers.

Output format :

For each test case, you don’t need to print anything just return an array containing the longest alternating subarray starting from each index of the array ‘NUMS’.

Note :

You don't need to print anything. It has already been taken care of. Just implement the given function.

Constraints :

1 <= T <= 10
1 <= N <= 10^5 
-10^6 <= NUMS[ i ] <= 10^6
Sum of N Over all the Test cases <= 10^5

Time Limit: 1 sec