#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

int N;
vector<int> A;

int f(int i) {
  int res = 0;

  for (int d = -23; d <= 0; ++d) {
    int from = i + d;
    int to = from + 23;
    if (from < 0) continue;
    if (N <= to) continue;

    int sum = 0;

    for (int idx = from; idx <= to; ++idx) {
      sum += A[idx];
    }

    res = max(res, sum);
  }

  return res;
}

int main() {
  cin >> N;
  A.resize(N);
  for (int i = 0; i < N; ++i) {
    cin >> A[i];
  }

  int Q;
  cin >> Q;
  int ans = 0;
  for (int i = 0; i < N; ++i) {
    ans = max(ans, f(i));
  }

  for (int i = 0; i < Q; ++i) {
    int t, v;
    cin >> t >> v;

    A[t - 1] = v;
    ans = max(ans, f(t - 1));

    cout << ans << endl;
  }

  return 0;
}