#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define eb emplace_back
#define pu push
#define ins insert
#define fi first
#define se second
#define all(a) a.begin(),a.end()
#define bruh ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define fu(x,a,b) for (auto x=a;x<=b;x++)
#define fd(x,a,b) for (auto x=a;x>=b;x--)
#define int ll
using namespace std;
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
/*
Competitive Programming notes that I need to study & fix my dumbass self:
1. Coding:
- Always be sure to check the memory of arrays (maybe use vectors), for loops
- Always try to maximize the memory if possible, even if you are going for subtasks
- Do not exploit #define int long long, it will kill you
2. Stress:
- Always try generating big testcases and try if they run
3. Time management:
- Don't overcommit or undercommit, always spend a certain amount of time to think a problem, don't just look at it and say I'm fucked
- Do not spend too much time coding brute-force solutions, they should be easily-codable solutions that don't take up too much time
Time management schedule:
Offline / LAH days (4 problems - 3h):
15' thinking of solution / idea
1. no idea: skip
2. yes idea: continue thinking for <= 15'
+ implementing: <= 20'
+ brute-force: <= 5'
+ test generator: <= 5'
I hate offline because I am dumb
*/
typedef pair<int, int> ii;
const int N = 5e5+5;
const int B = 750;
const int mod = 1e9+7;
const int inf = 1e18;
using cd = complex<double>;
const long double PI = acos(-1);
int power(int a,int b) {ll x = 1;if (a >= mod) a%=mod; while (b) {if (b & 1) x = x*a % mod;a = a*a % mod;b>>=1;}return x;}
int n, q;
int a[N], ans[N];
vector<ii> qu[N];
int mx[4*N], st[4*N], add[4*N], lazy[4*N];
void build(int id, int l, int r)
{
if (l == r)
{
mx[id] = st[id] = a[l];
return;
}
int mid = l+r>>1;
build(id*2, l, mid); build(id*2+1, mid+1, r);
mx[id] = max(mx[id*2], mx[id*2+1]);
st[id] = max(st[id*2], st[id*2+1]);
}
void push(int id)
{
if ((mx[id*2] + lazy[id]) >= st[id*2])
{
st[id*2] = (mx[id*2] + lazy[id]);
lazy[id*2] = lazy[id];
}
if ((mx[id*2+1] + lazy[id]) >= st[id*2+1])
{
st[id*2+1] = (mx[id*2+1] + lazy[id]);
lazy[id*2+1] = lazy[id];
}
lazy[id] = 0;
}
void update(int id, int l, int r, int u, int v, int w)
{
if (v < u) return;
if (l > v || r < u) return;
if (u <= l && r <= v)
{
if (w > add[id]) add[id] = w, lazy[id] = w;
st[id] = max(st[id], add[id] + mx[id]);
return;
}
int mid = l+r>>1;
push(id);
update(id*2, l, mid, u, v, w); update(id*2+1, mid+1, r, u, v, w);
st[id] = max(st[id*2], st[id*2+1]);
}
int get(int id, int l, int r, int u, int v)
{
if (l > v || r < u) return 0;
if (u <= l && r <= v) return st[id];
int mid = l+r>>1;
push(id);
return max(get(id*2, l, mid, u, v), get(id*2+1, mid+1, r, u, v));
}
void solve()
{
cin>>n;
for (int i = 1; i <= n; i++) cin>>a[i];
build(1,1,n);
cin>>q;
for (int i = 0; i < q; i++)
{
int l,r; cin>>l>>r;
qu[l].pb({r, i});
}
stack<int> stk;
for (int i = n; i >= 1; i--)
{
// cout<<"Current position: "<<i<<" "<<a[i]<<endl;
while (!stk.empty() && a[i] >= a[stk.top()])
{
int mid = stk.top();
// cout<<mid<<endl;
// cout<<"Range: "<<2*mid-i<<" "<<n<<endl;
// cout<<"Value: "<<a[i] + a[mid]<<endl;
stk.pop();
update(1, 1, n, 2*mid-i, n, a[i] + a[mid]);
}
if (!stk.empty())
{
int mid = stk.top();
// cout<<mid<<endl;
update(1, 1, n, 2*mid-i, n, a[i] + a[mid]);
}
stk.push(i);
for (auto j : qu[i])
{
// cout<<i+2<<" "<<j.fi<<endl;
ans[j.se] = get(1,1,n,i+2,j.fi);
}
}
for (int i = 0; i < q; i++) cout<<ans[i]<<endl;
}
/*
Go through the mistakes you usually make and revise your code, for god's sake...
*/
signed main()
{
bruh
//freopen("input.inp","r",stdin);
//freopen("output.inp","w",stdout);
int t = 1;
// cin>>t;
while (t--)
{
solve();
cout<<"\n";
}
}
