1333C.md (1825B)
1 Source: https://codeforces.com/problemset/problem/1333/C 2 3 C. Eugene and an array 4 5 time limit per test 6 7 1.5 seconds 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 Eugene likes working with arrays. And today he needs your help in solving one challenging task. 22 23 An array $c$ is a subarray of an array $b$ if $c$ can be obtained from $b$ by deletion of several (possibly, zero or all) elements from the beginning and several (possibly, zero or all) elements from the end. 24 25 Let's call a nonempty array good if for every nonempty subarray of this array, sum of the elements of this subarray is nonzero. For example, array $[-1, 2, -3]$ is good, as all arrays $[-1]$, $[-1, 2]$, $[-1, 2, -3]$, $[2]$, $[2, -3]$, $[-3]$ have nonzero sums of elements. However, array $[-1, 2, -1, -3]$ isn't good, as his subarray $[-1, 2, -1]$ has sum of elements equal to $0$. 26 27 Help Eugene to calculate the number of nonempty good subarrays of a given array $a$. 28 29 Input 30 31 The first line of the input contains a single integer $n$ ($1 \le n \le 2 \times 10^5$) — the length of array $a$. 32 33 The second line of the input contains $n$ integers $a_1, a_2, \dots, a_n$ ($-10^9 \le a_i \le 10^9$) — the elements of $a$. 34 35 Output 36 37 Output a single integer — the number of good subarrays of $a$. 38 39 Examples 40 41 Input 42 43 ``` 44 3 45 1 2 -3 46 ``` 47 48 Output 49 50 ``` 51 5 52 ``` 53 54 Input 55 56 ``` 57 3 58 41 -41 41 59 ``` 60 61 Output 62 63 ``` 64 3 65 ``` 66 67 Note 68 69 In the first sample, the following subarrays are good: $[1]$, $[1, 2]$, $[2]$, $[2, -3]$, $[-3]$. However, the subarray $[1, 2, -3]$ isn't good, as its subarray $[1, 2, -3]$ has sum of elements equal to $0$. 70 71 In the second sample, three subarrays of size 1 are the only good subarrays. At the same time, the subarray $[41, -41, 41]$ isn't good, as its subarray $[41, -41]$ has sum of elements equal to $0$.