Find the number of ways to partition array into segments such that sum of each segments is greater than 0,
Note- Concatenating the segments should result into full array.
Constraints: 1<=N<=10^5 1<=a[I]<=10^9 Example:
Input1: N=3, a[]={-1,-3,7}
Output: 1. (Complete array as one Segment)
Thanks
PS. This is not part of any running Contest.