Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > Subarrays with Sum in a Band

Subarrays with Sum in a Band

Difficulty: 1700 5000 ms 128 MB

two-pointers

All values are positive. Count the contiguous subarrays whose sum lies in [LO, HI].

Input: the first line has N, LO and HI; the second line has N positive integers.

Output: the number of subarrays with LO ≤ sum ≤ HI.

Constraints:

  • 1 ≤ N ≤ 105
  • 1 ≤ ai ≤ 1000
  • 1 ≤ LO ≤ HI ≤ 109

Sample Tests

Input 1
4 3 6
1 2 3 4
Output 1
5
Input 2
3 100 200
1 2 3
Output 2
0

Read the Editorial Statistics

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.
Ctrl+Enter submit · Ctrl+Space autocomplete · F11 fullscreen