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

#define BR "\n"
#define SP " "
#define SHOW(x) for(int i = 0; i < x.size(); i++) { cout << x[i] << SP; } cout << BR;
#define SHOW2(x) for(int j = 0; j < x.size(); j++) { SHOW(x[j]); } cout << BR;

int main() {
  ll N;
  cin >> N;

  vector<ll> A(N + 1, 0);
  vector<ll> S(N + 1);
  ll s = 0;
  ll m = 0;
  for (int i = 1; i <= N; i++) {
    ll temp;
    cin >> temp;
    A[i] = temp;

    s += temp;
    if (i >= 24) {
      s -= A[i - 24];
      S[i - 24 + 1] = s;
      m = max(m, s);
    }
  }

  ll Q;
  cin >> Q;

  for (int i = 0; i < Q; i++) {
    ll T, V;
    cin >> T >> V;
    for (int i = max(T - 23, 1LL); i <= T; i++) {
      S[i] += (V - A[T]);
      m = max(m, S[i]);
    }
    A[T] = V;
    // SHOW(A);
    // SHOW(S);
    cout << m << BR;
  }

  return 0;
}