This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define f first
#define s second
#define ll long long
#define pii pair<int,int>
using namespace std;
const int N = 2e5 + 5, mod = 1e9 + 7; // !
ll t, a[N];
int jump[N], p[N], c[N];
map<ll, int> f;
main(){
int n;
cin >> n;
for(int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i - 1];
}
int mn = n + 1;
for(int i = n; i >= 0; i--) {
if(f[a[i]]) mn = min(mn, f[a[i]]);
f[a[i]] = i;
// cout << i << "-->" << mn << endl;
p[i] = mn;
if(mn < n + 1 && c[p[i]] == c[jump[p[i]]]) c[i] = 1 + c[jump[i]] * 2, jump[i] = jump[jump[p[i]]];
else jump[i] = p[i], c[i] = 1;
}
int q;
cin >> q;
while(q--) {
int l, r;
cin >> l >> r;
--l;
int ans = 0;
while(true) {
if(p[l] > r) break;
if(jump[l] <= r) ans += c[l], l = jump[l];
else ans++, l = p[l];
}
cout << ans << "\n";
}
}
Compilation message (stderr)
sumzero.cpp:11:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
11 | main(){
| ^~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |