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

class UnionFind{
    private:
    vector<long long> par,siz;
    public:
    UnionFind(int N,vector<long long> A){
        par.resize(N,-1);
        siz = A;
    }
 
    int root(int x){ //連結成分の代表頂点を返す.
        if(par.at(x) == -1) return x;
        else return par.at(x) = root(par.at(x));
    }
    bool unite(int u, int 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(int u, int v){ //同じ連結成分ならtrue.
        if(root(u) == root(v)) return true;
        else return false;
    }
    int size(int pos){return siz.at(root(pos));} //posの連結成分の大きさを返す.
};

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

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