/*
ID: bqi3431
PROG: ~
LANG: C++11 
*/

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)

#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define beg(x) x.begin()
#define en(x) x.end()
#define all(x) beg(x), en(x)
#define resz resize

const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 300005;
const ld PI = 4*atan((ld)1);

template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);

    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class Arg, class... Args> void re(Arg& first, Args&... rest) { 
        re(first); re(rest...); 
    }

    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}

using namespace input;

namespace output {
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T, size_t SZ> void pr(const array<T,SZ>& x);
    template<class T> void pr(const vector<T>& x);
    template<class T> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);

    template<class T> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) { 
        pr(first); pr(rest...); 
    }

    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void prContain(const T& x) {
        pr("{");
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; // const needed for vector<bool>
        pr("}");
    }
    template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    template<class T> void pr(const vector<T>& x) { prContain(x); }
    template<class T> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
    
    void ps() { pr("\n"); }
    template<class Arg> void ps(const Arg& first) { 
        pr(first); ps(); // no space at end of line
    }
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) { 
        pr(first," "); ps(rest...); // print w/ spaces
    }
}

using namespace output;

namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
    }
}

using namespace io;

template<class T> T invGeneral(T a, T b) {
    a %= b; if (a == 0) return b == 1 ? 0 : -1;
    T x = invGeneral(b,a); 
    return x == -1 ? -1 : ((1-(ll)b*x)/a+b)%b;
}

template<class T> struct modular {
    T val; 
    explicit operator T() const { return val; }
    modular() { val = 0; }
    template<class U> modular(const U& v) {
        val = (-MOD <= v && v <= MOD) ? v : v % MOD;
        if (val < 0) val += MOD;
    }
    friend ostream& operator<<(ostream& os, const modular& a) { return os << a.val; }
    friend bool operator==(const modular& a, const modular& b) { return a.val == b.val; }
    friend bool operator!=(const modular& a, const modular& b) { return !(a == b); }

    modular operator-() const { return modular(-val); }
    modular& operator+=(const modular& m) { if ((val += m.val) >= MOD) val -= MOD; return *this; }
    modular& operator-=(const modular& m) { if ((val -= m.val) < 0) val += MOD; return *this; }
    modular& operator*=(const modular& m) { val = (ll)val*m.val%MOD; return *this; }
    friend modular exp(modular a, ll p) {
        modular ans = 1; for (; p; p /= 2, a *= a) if (p&1) ans *= a;
        return ans;
    }
    friend modular inv(const modular& a) { return invGeneral(a.val,MOD); } 
    // inv is equivalent to return exp(b,b.mod-2) if prime
    modular& operator/=(const modular& m) { return (*this) *= inv(m); }
    
    friend modular operator+(modular a, const modular& b) { return a += b; }
    friend modular operator-(modular a, const modular& b) { return a -= b; }
    friend modular operator*(modular a, const modular& b) { return a *= b; }
    
    friend modular operator/(modular a, const modular& b) { return a /= b; }
};

typedef modular<int> mi;
typedef pair<mi,mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;


bool Q;
struct Line {
	mutable ll k, m, p; // slope, y-intercept, last optimal x
	ll eval (ll x) { return k*x+m; }
	bool operator<(const Line& o) const { return Q ? p < o.p : k < o.k; }
};

struct LC : multiset<Line> { 
	// for doubles, use inf = 1/.0, div(a,b) = a/b
	const ll inf = LLONG_MAX;
	ll div(ll a, ll b) { return a/b-((a^b) < 0 && a%b); } // floored division
	ll bet(const Line& x, const Line& y) { // last x such that first line is better
		if (x.k == y.k) return x.m >= y.m ? inf : -inf;
		return div(y.m-x.m,x.k-y.k);
	}
	bool isect(iterator x, iterator y) { // updates x->p, determines if y is unneeded
		if (y == end()) { x->p = inf; return 0; }
		x->p = bet(*x,*y); return x->p >= y->p;
	}
	
	void add(ll k, ll m) {
		auto z = insert({k,m,0}), y = z++, x = y;
		while (isect(y, z)) z = erase(z);
		if (x != begin() && isect(--x, y)) isect(x, y = erase(y));
		while ((y = x) != begin() && (--x)->p >= y->p) isect(x, erase(y));
	}
	ll query(ll x) { 
		assert(!empty());
		Q = 1; auto l = *lb({0,0,x}); Q = 0;
		return l.eval(x);
	}
};

struct LC0 : deque<Line> { // linear time w/ additional assumptions
	// for doubles, use inf = 1/.0, div(a,b) = a/b
	const ll inf = LLONG_MAX;
	ll div(ll a, ll b) { return a/b-((a^b) < 0 && a%b); } // floored division
	ll bet(const Line& x, const Line& y) { // last x such that first line is better
		if (x.k == y.k) return x.m >= y.m ? inf : -inf;
		return div(y.m-x.m,x.k-y.k);
	}
	void addBack(Line L) {
	    while (1) {
	        auto a = back(); pop_back(); a.p = bet(a,L);
	        if (size() && back().p >= a.p) continue;
	        pb(a); break;
	    }
	    L.p = inf; pb(L);
	}
	void addFront(Line L) {
	    while (1) {
	        if (!size()) { L.p = inf; break; }
	        L.p = bet(L,front());
	        if (L.p >= front().p) pop_front();
	        else break;
	    }
	    push_front(L);
	}
	void add(ll k, ll m) { // assume line goes to one end of deque
		if (!size() || k <= front().k) addFront({k,m,0});
		else if (k >= back().k) addBack({k,m,0});
		else exit(5);
	}
	int ord = 0;
	ll query(ll x) { // assume x comes in increasing order
	    assert(ord);
		if (ord == 1) {
    		while (front().p < x) pop_front();
    		return front().eval(x);
		} else {
    		while (size() > 1 && prev(prev(end()))->p >= x) pop_back();
    		return back().eval(x);
		}
	}
};

int N,M;
ll yes[MX], no[MX], L[MX], R[MX];
ll cum[MX];
vi T;

void genNo() {
    {
        LC0 Z = LC0(); Z.ord = 1; 
        Z.add(0,0);
        FOR(i,1,N+1) {
            R[i] = max(R[i-1],(ll)i*i+i-2*cum[i]+Z.query(i));
            Z.add(-2*i,(ll)i*i-i+R[i]+2*cum[i]);
            // ps("WUT",i,R[i]);
        }
    }
    {
        LC0 Z = LC0(); Z.ord = -1; Z.add(-2*N,(ll)N*N+N-2*cum[N]);
        F0Rd(i,N) {
            L[i] = max(L[i+1],(ll)i*i-i+2*cum[i]+Z.query(i));
            Z.add(-2*i,(ll)i*i+i+L[i]-2*cum[i]);
        }
    }
    FOR(i,1,N+1) {
        no[i] = R[i-1]+L[i];
        // ps("HA",i,no[i],L[i]);
    }
}

void divi(int l, int r) {
    if (l > r) return;
    int m = (l+r)/2; // segment contains m 
    divi(l,m-1); divi(m+1,r);
    {
        LC0 Z = LC0(); Z.ord = 1; 
        FOR(i,l-1,m) Z.add(-2*i,(ll)i*i-i+R[i]+2*cum[i]);
        ll bes = -INF;
        FORd(i,m,r+1) {
            ckmax(bes,(ll)i*i+i-2*cum[i]+Z.query(i)+L[i]);
            ckmax(yes[i],bes);
        }
    }
    {
        LC0 Z = LC0(); Z.ord = -1; 
        FORd(i,m,r+1)  Z.add(-2*i,(ll)i*i+i+L[i]-2*cum[i]);
        ll bes = -INF;
        FOR(i,l-1,m) {
            ckmax(bes,(ll)i*i-i+2*cum[i]+Z.query(i)+R[i]);
            ckmax(yes[i+1],bes);
            // ps(i,L[i]);
        }
    }
}

int main() {
    setIO(); re(N); T.resz(N); re(T,M);
    FOR(i,1,N+1) {
        // T[i] = rand()%1000000;
        cum[i] = T[i-1]+cum[i-1];
    }
    genNo();
    // exit(0);
    FOR(i,1,N+1) yes[i] = -INF;
    divi(1,N);
    FOR(i,1,N+1) {
        assert(yes[i] % 2 == 0 && no[i] % 2 == 0);
        yes[i] /= 2, no[i] /= 2;
    }
    // ps(yes[1],yes[2],yes[3],yes[4],yes[5]);
    F0R(i,M) {
        int P,X; re(P,X); 
        // ps("HUH",P,X,yes[P],T[P-1],yes[P]+T[P-1]-X);
        ps(max(yes[P]+T[P-1]-X,no[P]));
    }
}

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?), set tle
    * do smth instead of nothing and stay organized
*/

Measured memory_bytes: 15488