//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define mem(a,v) memset((a), (v), sizeof (a))
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%I64d", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%I64d\n", (n))
#define pii pair<int, int>
#define pil pair<int, long long>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vil vector<pil>
#define vll vector<pll>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> oset;
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const int MAXN = 5e5 + 5;
const double eps = 1e-9;
int a[MAXN], lz[MAXN*3];
int nx[MAXN], ans[MAXN];
vii x[MAXN], y[MAXN];
pii seg[MAXN*3];
void build(int l, int r, int k) {
if (l == r) {
seg[k] = mp(-INF,-INF);
return;
}
int m = (l+r) / 2;
build(l,m,k*2);
build(m+1,r,k*2+1);
seg[k].fi = max(seg[k*2].fi, seg[k*2+1].fi);
seg[k].se = max(seg[k*2].se, seg[k*2+1].se);
}
void prop(int l, int r, int k) {
if (l != r) {
lz[k*2] = max(lz[k*2], lz[k]);
lz[k*2+1] = max(lz[k*2+1], lz[k]);
}
seg[k].se = max(seg[k].se, seg[k].fi + lz[k]);
lz[k] = 0;
}
void upd(int l, int r, int k, int a, int b) {
prop(l,r,k);
if (r < a || a < l) return;
if (l == r) {
seg[k].fi = max(seg[k].fi, b);
return;
}
int m = (l+r) / 2;
upd(l,m,k*2,a,b);
upd(m+1,r,k*2+1,a,b);
seg[k].fi = max(seg[k*2].fi, seg[k*2+1].fi);
seg[k].se = max(seg[k*2].se, seg[k*2+1].se);
}
int qry(int l, int r, int k, int a, int b) {
prop(l,r,k);
if (b < l || r < a) return 0;
if (a <= l && r <= b) return seg[k].se;
int m = (l+r) / 2;
return max(qry(l,m,k*2,a,b),qry(m+1,r,k*2+1,a,b));
}
int main() {
int n, q; ni(n); nai(a, n);
for (int i = 0; i < n; i++) {
nx[i] = i-1;
while (nx[i] != -1 && a[nx[i]] < a[i])
nx[i] = nx[nx[i]];
if (nx[i] != -1 && 2 * i - nx[i] < n)
x[2*i-nx[i]].pb(mp(nx[i], a[nx[i]]+a[i]));
}
for (int i = n-1; i >= 0; i--) {
nx[i] = i+1;
while (nx[i] != n && a[nx[i]] < a[i])
nx[i] = nx[nx[i]];
if (nx[i] != n && 2 * nx[i] - i < n)
x[2*nx[i]-i].pb(mp(i, a[nx[i]]+a[i]));
if (i+2 < n)
x[i+2].pb(mp(i, a[i] + a[i+1]));
}
ni(q);
for (int i = 0; i < q; i++) {
int ll, rr; scanf("%d %d", &ll, &rr);
ll--, rr--;
y[rr].pb(mp(ll, i));
}
build(0, n-1, 1);
for (int i = 0; i < n; i++) {
for (pii tmp: x[i])
upd(0, n-1, 1, tmp.fi, tmp.se);
lz[1] = max(lz[1], a[i]);
for (pii tmp: y[i])
ans[tmp.se] = qry(0, n-1, 1, tmp.fi, n-1);
}
for (int i = 0; i < q; i++)
pri(ans[i]);
return 0;
}
