<p>A split of an integer array is <strong>good</strong> if:</p>

<ul>
	<li>The array is split into three <strong>non-empty</strong> contiguous subarrays - named <code>left</code>, <code>mid</code>, <code>right</code> respectively from left to right.</li>
	<li>The sum of the elements in <code>left</code> is less than or equal to the sum of the elements in <code>mid</code>, and the sum of the elements in <code>mid</code> is less than or equal to the sum of the elements in <code>right</code>.</li>
</ul>

<p>Given <code>nums</code>, an array of <strong>non-negative</strong> integers, return <em>the number of <strong>good</strong> ways to split</em> <code>nums</code>. As the number may be too large, return it <strong>modulo</strong> <code>10<sup>9 </sup>+ 7</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,1,1]
<strong>Output:</strong> 1
<strong>Explanation:</strong> The only good way to split nums is [1] [1] [1].</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,2,2,2,5,0]
<strong>Output:</strong> 3
<strong>Explanation:</strong> There are three good ways of splitting nums:
[1] [2] [2,2,5,0]
[1] [2,2] [2,5,0]
[1,2] [2,2] [5,0]
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> nums = [3,2,1]
<strong>Output:</strong> 0
<strong>Explanation:</strong> There is no good way to split nums.</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>3 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>0 &lt;= nums[i] &lt;= 10<sup>4</sup></code></li>
</ul>

class Solution:
    def waysToSplit(self, nums: List[int]) -> int:
        pre_comp_sum = []
        cur_sum = 0
        for num in nums:
            pre_comp_sum.append(cur_sum)
            cur_sum += num
        pre_comp_sum.append(cur_sum)
        
        # print(pre_comp_sum)

        good_arrays = 0
        left_bound = 1
        mid_left_bound = 2
        mid_right_bound = 2
        while left_bound < len(nums) and mid_left_bound < len(nums):
            while mid_left_bound <= left_bound or (mid_left_bound < len(nums) and pre_comp_sum[left_bound] * 2 > pre_comp_sum[mid_left_bound]):
                mid_left_bound += 1
        
            mid_right_bound =  max(mid_left_bound, mid_right_bound)
            while mid_right_bound < len(nums) and pre_comp_sum[mid_right_bound] * 2 <= pre_comp_sum[-1] + pre_comp_sum[left_bound]:
                mid_right_bound += 1
            print(f"{left_bound} {mid_left_bound} {mid_right_bound}")
            good_arrays += mid_right_bound - mid_left_bound
            left_bound += 1

        return good_arrays % 1000000007

            
29800