#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
    ll n;
    std::cin >> n;
    vector<ll> a(n);
    vector<ll> sum(n-23);
    ll mav = -1;
    ll val = 0;
    for (int i = 0; i < n; i++) {
        std::cin >> a[i];
        val+=a[i];
        if(i>=23){
            sum[i-23] = val;
            mav = max(sum[i-23],mav);
            val -= a[i-23];
        }
    }
    ll q;
    std::cin >> q;
    for (int i = 0; i < q; i++) {
        ll t,v;
        std::cin >> t>>v;
        t--;
        ll dif = v-a[t];
        a[t] = v;
        for (int j = t-23; j <= min(t,n-24); j++) {
            if(j<0)continue;
            sum[j] += dif;
            // std::cout << i<<" "<<j << std::endl;
            mav = max(mav,sum[j]);
        }
        std::cout << mav << std::endl;
    }
}