// Starcraft 2 enjoyer //
#include <bits/stdc++.h>
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
using namespace std;
#define LSOne(X) ((X) & -(X))
#define int long long
const int N = 5e5 + 5;
const int M = 2e6 + 5;
const long long K = 2;
const int LG = 60;
const long long INF = 1e18 + 5;
const int C = 26;
const int B = 1000;
const int MOD = 998244353;
struct Node
{
int lazy, add, mx;
Node operator+(const Node &a)
{
Node ans;
ans.mx = max(mx, a.mx);
ans.add = max(add, a.add);
ans.lazy = 0;
return ans;
}
};
struct LazySegmentTree
{
vector<Node> st;
int n, *a;
void build(int v, int l, int r)
{
if (l == r)
{
st[v].add = a[l];
st[v].mx = 0;
st[v].lazy = 0;
}
else
{
int m = (l + r) / 2;
build(2 * v, l, m);
build(2 * v + 1, m + 1, r);
st[v] = st[2 * v] + st[2 * v + 1];
}
}
void prop(int v, int l, int r)
{
st[v].mx = max(st[v].mx, st[v].lazy + st[v].add);
if (l != r)
{
st[2 * v].lazy = max(st[2 * v].lazy, st[v].lazy);
st[2 * v + 1].lazy = max(st[2 * v + 1].lazy, st[v].lazy);
}
st[v].lazy = 0;
}
void update(int v, int val, int l, int r, int tl, int tr)
{
prop(v, l, r);
if (tl > tr)
return;
if (tl <= l && r <= tr)
{
st[v].lazy = max(st[v].lazy, val);
prop(v, l, r);
}
else
{
int m = (l + r) / 2;
update(2 * v, val, l, m, tl, min(tr, m));
update(2 * v + 1, val, m + 1, r, max(tl, m + 1), tr);
st[v] = st[2 * v] + st[2 * v + 1];
}
}
int get(int v, int l, int r, int tl, int tr)
{
prop(v, l, r);
if (tl > tr)
return 0;
if (tl <= l && r <= tr)
{
// cout << st[v].mx << " " << st[v].add << " " << l << " " << r << "\n";
return st[v].mx;
}
else
{
int m = (l + r) / 2;
return max(get(2 * v, l, m, tl, min(tr, m)), get(2 * v + 1, m + 1, r, max(tl, m + 1), tr));
}
}
LazySegmentTree(int len)
{
n = len;
st.assign(4 * n, {});
}
void build(int *v)
{
a = v;
build(1, 0, n - 1);
}
void update(int val, int l, int r)
{
if (l > r)
return;
update(1, val, 0, n - 1, l, r);
}
int get(int l, int r)
{
return get(1, 0, n - 1, l, r);
}
};
int n, a[N], q, ans[N], nxt[N];
vector<int> add[N], mono;
vector<pair<int, int>> query[N];
inline void solve()
{
cin >> n;
for (int x = 0; x < n; x++)
{
cin >> a[x];
}
for (int x = n - 1; x >= 0; x--)
{
while (!mono.empty())
{
if (a[mono.back()] < a[x])
{
mono.pop_back();
}
else
{
break;
}
}
if (!mono.empty())
nxt[x] = mono.back();
else
nxt[x] = -1;
mono.push_back(x);
}
for (int x = 0; x < n; x++)
{
int mx = 0;
int y = x + 1;
while (y != -1 && y < n)
{
if (mx >= a[x])
break;
if (mx < a[y])
{
// cout << x << " " << y << "\n";
add[x].push_back(y);
}
mx = max(mx, a[y]);
y = nxt[y];
}
}
LazySegmentTree st(n);
st.build(a);
cin >> q;
for (int x = 0; x < q; x++)
{
int l, r;
cin >> l >> r;
l--;
r--;
query[l].push_back({r, x});
}
for (int x = n - 1; x >= 0; x--)
{
for (int i : add[x])
{
st.update(a[x] + a[i], x + 2 * (i - x), n - 1);
}
for (auto &[r, i] : query[x])
{
ans[i] = st.get(x, r);
}
}
for (int x = 0; x < q; x++)
{
cout << ans[x] << "\n";
}
}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin >> t;
for (int x = 1; x <= t; x++)
{
solve();
}
return 0;
}
