GeezerVison

The World Wide Web, restored to 800 pixels of glory.

GeezerVison is showing www.hackerrank.com — Java Subarray | HackerRank

We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.

We define the following:

A subarray of an -element array is an array composed from a contiguous block of the original array's elements. For example, if , then the subarrays are , , , , , and . Something like would not be a subarray as it's not a contiguous subsection of the original array.
The sum of an array is the total sum of its elements.
- An array's sum is negative if the total sum of its elements is negative.
- An array's sum is positive if the total sum of its elements is positive.

Given an array of integers, find and print its number of negative subarrays on a new line.

Input Format

The first line contains a single integer, , denoting the length of array .
The second line contains space-separated integers describing each respective element, , in array .

Constraints

Output Format

Print the number of subarrays of having negative sums.

Sample Input

5
1 -2 4 -5 1

Sample Output

Explanation

There are nine negative subarrays of :

Thus, we print on a new line.

Cookie support is required to access HackerRank

Seems like cookies are disabled on this browser, please enable them to open this website

You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.