#pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; template<typename T> using ordered_set = tree<T,null_type,less<T>,rb_tree_tag, tree_order_statistics_node_update>; #define ll long long #define pi pair<int,int> #define vi vector<int> #define pb push_back #define all(a) a.begin(),a.end() const int mxn = 1e5+1, lg2 = 17; int suc[mxn][lg2]; vector<int> g[mxn]; bool vis[mxn]; void dfs(int u){ vis[u] = 1; for(int i = 1; i < lg2; i++){ if(suc[u][i-1]==-1) suc[u][i] = -1; else suc[u][i] = suc[suc[u][i-1]][i-1]; } for(auto v : g[u]){ suc[v][0] = u; dfs(v); } } void solve(){ int n; cin >> n; int last = -1; map<ll,int> mp; mp[0] = 0; ll sum = 0; for(int i = 1; i <= n; i++){ int a; cin >> a; sum += a; if(mp.count(sum) && mp[sum] > last) last = mp[sum]; mp[sum] = i; if(last!=-1) g[last].push_back(i); } for(int i = 0; i <= n; i++) if(!vis[i]){ suc[i][0] = -1; dfs(i); } int q; cin >> q; for(int i = 0; i < q; i++){ int l,r; cin >> l >> r; int ans = 0; for(int j = lg2-1; j >= 0; j--) if(suc[r][j] >= l-1){ ans += (1<<j); r = suc[r][j]; } cout << ans << '\n'; } } signed main(){ cin.tie(0)->sync_with_stdio(0); int t = 1; // cin >> t; while(t--){solve();} }