Time complexity of getting the number of subarrays of an array that satisfies a certain condition

What is the optimal time complexity of getting the number of subarrays of an array that satisfies a certain condition. For example, [24, 36, 21, 56, 3, 9, 75], we attempt to get the number of subarrays that the summation is greater than the summation of values outside the subarray.