Given an array of integers, determine the number of ways the entire array be split into two non-empty subarrays, left and right, such that the sum of elements in the left subarray is greater than the sum of elements in the right subarray. Example
arr = [10, 4, -8, 7]
There are three ways to split it into two non-empty subarrays:
[10] and [4, -8, 7], left sum = 10, right sum = 3
[10, 4] and [-8, 7], left sum = 10 + 4 = 14, right sum = -8 + 7 = -1
[10, 4, -8] and [7], left sum = 6, right sum = 7
The first two satisfy the condition that left sum > right sum, so the return value should be 2.
Function Description
Complete the function splitIntoTwo in the editor below. The function must return a single integer.
splitIntoTwo has the following parameter(s):
int arr[n]: integer array
Constraints
2 ≤ n ≤ 105
-104 ≤ arr[i] ≤ 104
Input Format Format for Custom Testing
Input from stdin will be processed as follows and passed to the function.
In the first line, there is a single integer n.
Each of the next n lines contains an integer, arr[i].
Sample Case 0
Sample Input
STDIN Function

3 → arr[] size n = 3
10 → arr = [10, -5, 6]
-5
6
Sample Output
1
Explanation
There are two ways to split the array: [10], [-5,6] with sums 10 and 1, sum left > sum right, and [10, -5], [6] with sums 5 and 6, sum left < sum right.
Sample Case 1
Sample Input
STDIN Function

5 → arr[] size n = 5
-3 → arr = [-3, -2, 1-, 20, -30]
-2
10
20
-30
Sample Output
2
Explanation
There are two ways to split arr into two-non empty arrays such that the sum of elements in the left subarray is greater than the sum of elements in the right subarray:
[-3, -2, 10] and [20, -30], the sum of left is 5 and the sum of right is -10
[-3, -2, 10, 20] and [-30], the sum of left is 25 and the sum of right is -30
Given an array of integers, determine the number of ways the entire array be split into two non-empty subarrays, left and right, such that the sum of elements in the left subarray is greater than the sum of elements in the right subarray.
Example
arr = [10, 4, -8, 7]
There are three ways to split it into two non-empty subarrays:
[10] and [4, -8, 7], left sum = 10, right sum = 3
[10, 4] and [-8, 7], left sum = 10 + 4 = 14, right sum = -8 + 7 = -1
[10, 4, -8] and [7], left sum = 6, right sum = 7
The first two satisfy the condition that left sum > right sum, so the return value should be 2.
Function Description
Complete the function splitIntoTwo in the editor below. The function must return a single integer.
splitIntoTwo has the following parameter(s):
int arr[n]: integer array
Constraints
2 ≤ n ≤ 105
-104 ≤ arr[i] ≤ 104
Input Format Format for Custom Testing
Input from stdin will be processed as follows and passed to the function.
In the first line, there is a single integer n.
Each of the next n lines contains an integer, arr[i].
Sample Case 0
Sample Input
STDIN Function

3 → arr[] size n = 3
10 → arr = [10, -5, 6]
-5
6
Sample Output
1
Explanation
There are two ways to split the array: [10], [-5,6] with sums 10 and 1, sum left > sum right, and [10, -5], [6] with sums 5 and 6, sum left < sum right.
Sample Case 1
Sample Input
STDIN Function

5 → arr[] size n = 5
-3 → arr = [-3, -2, 1-, 20, -30]
-2
10
20
-30
Sample Output
2
Explanation
There are two ways to split arr into two-non empty arrays such that the sum of elements in the left subarray is greater than the sum of elements in the right subarray:
[-3, -2, 10] and [20, -30], the sum of left is 5 and the sum of right is -10
[-3, -2, 10, 20] and [-30], the sum of left is 25 and the sum of right is -30