402818: GYM100889 B Backward and Forward

An array is called a 'Mirror' if it reads the same backward and forward. For example, [23, 15, 23] is a 'Mirror' but [2, 0, 1] is not.

You are given an array A of size N. Your task is to make a given array a 'Mirror'. The only allowed operation is that you can merge two adjacent elements in the array and replace them with their sum.

Find minimum number of operations required to make given array a 'Mirror' such that it reads the same backward and forward.

First line contains T(1 ≤ T ≤ 20), the number of test cases. Each test case consist of 2 lines. First line contains number N(1 ≤ N ≤ 10⁵), size of the array. Next line contains N space separated integers A_i(0 ≤ A_i ≤ 10⁹) denoting elements in the array A.

For each test case output in one line minimum steps required to make given array a 'Mirror'.

2
3
1 0 1
5
10 20 20 10 40

0
3

Sample test case 1:

Given array is already a 'Mirror' . So, no need to perform any operation.

Sample test case 2:

One possible sequence of operations.

Step 1 : Merge 2^nd and 3^rd element to get array [10, 40, 10, 40].

Step 2 : Merge 1^st and 2^nd element to get array [50, 10, 40].

Step 3 : Merge 2^nd and 3^rd element to get array [50, 50].