Non-negative subarray - MarisaOJ: Marisa Online Judge

You are given an array

A

$A$ of

n

$n$ integers. Count the number of subarrays with non-negative sum. ### Input - The first line contains an integer

n

$n$ . - The second line contains

n

$n$ integers

A_{i}

$A_i$ . ### Output - Print the number of subarrays. ### Constraints -

1 \leq n \leq 10^{5}

$1 \le n \le 10^5$ . -

0 \leq | A_{i} | \leq 10^{9}

$0 \le |A_i| \le 10^9$ . ### Example Input:

31 - 21

$3 1 -2 1$

Output:

3

$3$

Topic

Data structure

Rating

1500

Solution (0)

Solution