/*#pragma GCC optimize("O3")
#pragma GCC optimization("Ofast,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")*/
#include <bits/stdc++.h>
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>*/
#define ll long long
#define ll1 long long
#define ull unsigned long long
#define dou long double
#define str string
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define vpll vector<pair<ll, ll>>
#define vbool vector<bool>
#define vstr vector<str>
#define vvll vector<vll>
#define pb push_back
#define pf push_front
#define endl "\n"
#define fr first
#define se second
// #define sortcmp(a) sort(a.begin(), a.end(), cmp)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define ordered_set tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>
using namespace std;
//using namespace __gnu_pbds;
const ll INF = 1e18+7;
const int lg = 20;
const ll MOD = 1e9+7;
//const ll MOD2 = 998244353;
//const ll MOD3 = 1e6+3;
mt19937 rng(1488);
ll randll(ll l, ll r) {
return uniform_int_distribution<ll>(l, r)(rng);
}
vll tree1, d, tree;
void push(ll v, ll tl, ll tr) {
if (tl == tr) return;
tree[v*2] = max(tree[v*2], d[v]+tree1[v*2]);
tree[v*2+1] = max(tree[v*2+1], d[v]+tree1[v*2+1]);
d[v*2] = max(d[v], d[v*2]);
d[v*2+1] = max(d[v], d[v*2+1]);
d[v] = 0;
tree[v] = max(tree[v*2], tree[v*2+1]);
}
void bt(ll v, ll tl, ll tr, vll& a) {
if (tl == tr) {
tree1[v] = a[tl];
return;
}
ll tm = (tl+tr)/2;
bt(v*2, tl, tm, a);
bt(v*2+1, tm+1, tr, a);
tree1[v] = max(tree1[v*2], tree1[v*2+1]);
}
ll get(ll l, ll r, ll v, ll tl, ll tr) {
if (l <= tl && tr <= r) return tree[v];
if (tl > r || tr < l) return -INF;
ll tm = (tl+tr)/2;
push(v, tl, tr);
ll p = get(l, r, v*2, tl, tm), p1 = get(l, r, v*2+1, tm+1, tr);
return max(p,p1);
}
void update(ll l, ll r, ll val, ll v, ll tl, ll tr) {
if (l <= tl && tr <= r) {
tree[v] = max(tree[v], val+tree1[v]);
d[v] = max(d[v], val);
push(v, tl, tr);
return;
}
if (tl > r || tr < l) return;
ll tm = (tl+tr)/2;
push(v, tl, tr);
update(l, r, val, v*2, tl, tm);
update(l, r, val, v*2+1, tm+1, tr);
tree[v] = max(tree[v*2], tree[v*2+1]);
}
int main() {
speed;
ll n;
cin >> n;
vll a(n);
for (int i = 0; i < n; i ++) {
cin >> a[i];
}
vpll v, p;
for (int i = 0; i < n; i ++) {
while (v.size() && a[i] > v.back().fr) v.pop_back();
if (v.size()) p.pb({v.back().se, i});
while (v.size() && a[i] == v.back().fr) v.pop_back();
v.pb({a[i], i});
}
v.clear();
for (int i = n-1; i >= 0; i --) {
while (v.size() && a[i] > v.back().fr) v.pop_back();
if (v.size()) p.pb({i, v.back().se});
while (v.size() && a[i] == v.back().fr) v.pop_back();
v.pb({a[i], i});
}
vvll q1(n);
ll q;
cin >> q;
vpll qu(q);
for (int i = 0; i < q; i ++) {
ll l, r;
cin >> l >> r;
l --, r --;
qu[i] = {l, r};
q1[l].pb(i);
}
vvll v1(n);
for (auto i : p) {
v1[i.fr].pb(i.se);
}
tree.resize(n*4+7, 0);
d.resize(n*4+7, 0);
tree1.resize(n*4+7, 0);
bt(1, 0, n-1, a);
vll res(q);
for (int i = n-1; i >= 0; i --) {
for (int j : v1[i]) {
if (j*2-i >= n) continue;
//cout << i << ' ' << j << ' ' << j*2-i << ' ' << a[i]+a[j] << endl;
update(j*2-i, n-1, a[i]+a[j], 1, 0, n-1);
}
for (int j : q1[i]) {
res[j] = get(i, qu[j].se, 1, 0, n-1);
}
}
for (int i = 0; i < q; i ++) {
cout << res[i] << endl;
}
}
