# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1118631 | pera | Sum Zero (RMI20_sumzero) | C++17 | 0 ms | 0 KiB |
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 LL long long
using namespace std;
const int N = 4e5 + 1;
int a[N] , l[N] , r[N] , ans[N];
vector<int> lst(N) , e;
int main(){
cin.tie(0)->sync_with_stdio(0);
int n;
cin >> n;
for(int i = 1;i <= n;i ++){
cin >> a[i];
}
LL sum = 0;
map<LL , int> e;
e[0] = 0;
lst[0] = -1;
for(int i = 1;i <= n;i ++){
sum += a[i];
if(e.find(sum) != e.end()){
lst[i] = e[sum];
}else{
lst[i] = -1;
}
lst[i] = max(lst[i] , lst[i - 1]);
e[sum] = i;
}
int q;
cin >> q;
memset(ans , 0 , sizeof(ans));
for(int i = 0;i < q;i ++){
cin >> l[i] >> r[i];
}
for(int bit = 18;bit >= 0;bit --){
e = lst;
for(int c = 0;c < bit;c ++){
for(int i = n;i >= 0;i --){
e[i] = (e[i] > -1 ? e[e[i]] : -1);
}
}
for(int i = 0;i < q;i ++){
if(e[r[i]] >= l[i] - 1){
ans[i] += 1 << bit;
r[i] = e[r[i]];
}
}
}
for(int i = 0;i < q;i ++){
cout << ans[i] << '\n';
}
}