#include <bits/stdc++.h>
using namespace std;

class UnionFind{
    private:
    vector<long long> par,siz;
    public:
    UnionFind(long long N,vector<long long> A){
        par.resize(N,-1);
        siz = A;
    }
 
    long long root(long long x){ //連結成分の代表頂点を返す.
        if(par.at(x) == -1) return x;
        else return par.at(x) = root(par.at(x));
    }
    bool unite(long long u, long long v){ //u,vを連結する 連結してた->false,した->trueを返す.
        u = root(u),v = root(v);
        if(u == v) return false;
 
        if(siz.at(u) < siz.at(v)) swap(u,v); //Union by size.
        par.at(v) = u;
        siz.at(u) += siz.at(v);
        return true;
    }
    bool issame(long long u, long long v){ //同じ連結成分ならtrue.
        if(root(u) == root(v)) return true;
        else return false;
    }
    long long size(long long pos){return siz.at(root(pos));} //posの連結成分の大きさを返す.
};

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    long long N; cin >> N;
    vector<long long> A(N+2);
    for(long long i=1; i<=N; i++) cin >> A.at(i);
    UnionFind Z(N+2,A);
    for(long long i=0; i<N+1; i++) if(A.at(i) > 0 && A.at(i+1) > 0) Z.unite(i,i+1); 
    
    long long Q; cin >> Q;
    while(Q--){
        long long p,b; cin >> p >> b;
        long long add = b-A.at(p);
        long long l = 0,r = 0;
        l = Z.size(p-1);
        r = Z.size(p+1);
        if(Z.issame(p-1,p+1)) r = 0;
        
        cout << max(b,l+r+add) << "\n";
    }
}