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>
using namespace std;
int P[100001][16];
int main(){
int n;
cin>>n;
long long arr[n];
map<int,int> mp;
long long sum = 0;
mp[0] = 1;
for(int i = 0;i<n;i++){
cin>>arr[i];
sum+=arr[i];
if(mp[sum]>0){
P[mp[sum]-1][0] = i;
}
mp[sum] = i+2;
}
for(int i = 0;i<=n;i++){
if(P[i][0]==0)P[i][0] = n;
}
for(int i = n;i>=0;i--){
if(i<n)P[i][0] = min(P[i][0],P[i+1][0]);
for(int j = 1;j<16;j++){
P[i][j] = P[min(n,P[i][j-1]+1)][j-1];
}
}
int q;cin>>q;
while(q--){
int l,r;cin>>l>>r;l--;r--;
int ans = 0;
for(int i = 15;i>=0;i--){
if(P[l][i]<=r){
ans+=(1<<i);
l = P[l][i]+1;
}
}
cout<<ans<<endl;
}
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |