#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 3;
int n, q, a[N], res[N];
vector<pair<int, int>> queries[N];
struct Node {
int mx;
int mx_tot;
} seg[N * 4];
int lazy[N * 4];
void build(int id, int l, int r){
if (l == r){
seg[id].mx = a[l];
return;
}
int mid = (l + r) / 2;
build(id * 2, l, mid);
build(id * 2 + 1, mid + 1, r);
seg[id].mx = max(seg[id * 2].mx, seg[id * 2 + 1].mx);
}
void push(int id){
if (!lazy[id]) return;
seg[id * 2].mx_tot = max(seg[id * 2].mx_tot, seg[id * 2].mx + lazy[id]);
seg[id * 2 + 1].mx_tot = max(seg[id * 2 + 1].mx_tot, seg[id * 2 + 1].mx + lazy[id]);
lazy[id * 2] = max(lazy[id * 2], lazy[id]);
lazy[id * 2 + 1] = max(lazy[id * 2 + 1], lazy[id]);
lazy[id] = 0;
}
void update(int id, int l, int r, int u, int v, int x){
if (u > v) return;
if (u <= l && r <= v){
seg[id].mx_tot = max(seg[id].mx_tot, seg[id].mx + x);
lazy[id] = max(lazy[id], x);
return;
}
push(id);
int mid = (l + r) / 2;
if (u <= mid) update(id * 2, l, mid, u, v, x);
if (v > mid) update(id * 2 + 1, mid + 1, r, u, v, x);
seg[id].mx_tot = max({seg[id].mx_tot, seg[id * 2].mx_tot, seg[id * 2 + 1].mx_tot});
}
int get(int id, int l, int r, int u, int v){
if (v < l || r < u) return 0;
if (u <= l && r <= v) return seg[id].mx_tot;
push(id);
int mid = (l + r) / 2;
return max(get(id * 2, l, mid, u, v), get(id * 2 + 1, mid + 1, r, u, v));
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i];
cin >> q;
for (int i = 1, l, r; i <= q; ++i){
cin >> l >> r;
queries[l].emplace_back(r, i);
}
build(1, 1, n);
vector<int> st;
for (int i = n; i >= 1; --i){
while(!st.empty() && a[i] >= a[st.back()]){
update(1, 1, n, 2 * st.back() - i, n, a[i] + a[st.back()]);
st.pop_back();
}
if (!st.empty()){
update(1, 1, n, 2 * st.back() - i, n, a[i] + a[st.back()]);
}
st.push_back(i);
for (auto [r, id] : queries[i]){
res[id] = get(1, 1, n, i, r);
}
}
for (int i = 1; i <= q; ++i)
cout << res[i] << '\n';
}
