// #include "rect.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
double cur = rngesus(0, MASK(60) - 1);
cur /= MASK(60) - 1;
return l + cur * (r - l);
}
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
for(auto item: container) out << item << separator;
out << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
const ll INF = 1e18 + 69;
struct SegmentTree{
struct Node{
ll val, lazy, ma;
Node(){ma = 0; lazy = val = -INF;}
};
int n;
vector<Node> a;
void build_tree(int l, int r, int id, vector<int> &b){
if (l == r){a[id].val = b[l] - INF; a[id].ma = b[l]; return;}
int mid = (l + r) >> 1;
build_tree(l, mid, id * 2, b);
build_tree(mid + 1, r, id * 2 + 1, b);
a[id].ma = max(a[id * 2].ma, a[id * 2 + 1].ma);
a[id].val = max(a[id * 2].val, a[id * 2 + 1].val);
}
SegmentTree(int _n, vector<int> b){
n = _n;
a.resize(n*4+4);
build_tree(1, n, 1, b);
}
void update_node(int id, ll val){
maximize(a[id].lazy, val);
maximize(a[id].val, a[id].ma + val);
}
void down(int id){
update_node(id * 2, a[id].lazy);
update_node(id * 2 + 1, a[id].lazy);
}
void update(int u, int v, ll val, int l, int r, int id){
if (u <= l && r <= v){
update_node(id, val);
return;
}
down(id);
int mid = (l + r) >> 1;
if (u <= mid) update(u, v, val, l, mid, id * 2);
if (v > mid) update(u, v, val, mid + 1, r, id * 2 + 1);
a[id].val = max(a[id * 2].val, a[id * 2 + 1].val);
}
void update(int u, int v, ll val){
update(u, v, val, 1, n, 1);
}
ll get(int u, int v, int l, int r, int id){
if (u <= l && r <= v) return a[id].val;
down(id);
int mid = (l + r) >> 1;
ll ans = -INF;
if (u <= mid) maximize(ans, get(u, v, l, mid, id * 2));
if (v > mid) maximize(ans, get(u, v, mid + 1, r, id * 2 + 1));
return ans;
}
ll get(int u, int v){
return get(u, v, 1, n, 1);
}
};
int main(void){
ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
clock_t start = clock();
int n; cin >> n;
vector<int> a(n+1);
for(int i = 1; i<=n; ++i) cin >> a[i];
SegmentTree segg(n, a);
vector<vector<int>> sigma(n+1);
vector<int> st;
for(int i = n; i>=1; --i){
while(st.size() && a[st.back()] <= a[i]){
sigma[i].push_back(st.back());
st.pop_back();
}
if (st.size()) sigma[i].push_back(st.back());
st.push_back(i);
}
int q; cin >> q;
vector<vector<pair<int, int>>> queries(n+1);
vector<ll> ans(q);
for(int i = 0; i<q; ++i){
int l, r; cin >> l >> r;
queries[l].push_back({r, i});
}
for(int i = n; i>=1; --i){
for(int j: sigma[i]){
int k = j + (j - i);
if (k > n) continue;
segg.update(k, n, a[i] + a[j]);
}
for(pair<int, int> j: queries[i]){
ans[j.second] = segg.get(1, j.first);
}
}
printArr(ans, "\n", "");
cerr << "Time elapsed: " << clock() - start << " ms\n";
return 0;
}
