#include <bits/stdc++.h>

using namespace std;
using ll = long long int;

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

  ll n;
  cin >> n;
  vector<ll> a(n);
  for (auto &x : a)
    cin >> x;
  vector<ll> A(n + 1);
  for (ll i = 0; i < n; i++)
    A[i + 1] = A[i] + a[i];

  ll b_size = n - 24 + 1;
  vector<ll> b(b_size);
  ll ans = 0;
  for (ll i = 0; i + 24 <= n; i++) {
    b[i] = A[i + 24] - A[i];
    ans = max(ans, b[i]);
  }

  ll q;
  cin >> q;
  while (--q >= 0) {
    ll t, v;
    cin >> t >> v;
    t--;
    ll d = v - a[t];
    for (ll i = max(0LL, t - 23); i < min(b_size, t + 1); i++) {
      b[i] += d;
      ans = max(ans, b[i]);
    }
    cout << ans << endl;
  }

  return 0;
}