Count the Hidden Sequences LeetCode solution in C++

1
class Solution {
2
 public:
3
  int numberOfArrays(vector<int> &d, int l, int u) {
4
    long long int n = d.size();
5
    long long int pr = 0;
6
    long long int mini = 0;
7
    long long int maxi = 0;
8
    for (long long int i = 0; i < n; i++) {
9
      pr += d[i];
10
      maxi = max(maxi, pr);
11
      mini = min(mini, pr);
12
    }
13

14
    long long int range = maxi - mini;
15
    long long int cnt = 0;
16
    if (u - l < range) return 0;
17
    cnt = u - (l + range);
18
    return cnt + 1;
19
  }
20
};