#include <iostream>
#include <algorithm>
#include <cassert>
using namespace std;
#pragma warning (disable: 4996)

int N, Q, A[200009], maxn;

int main() {
	scanf("%d", &N);
	assert(24 <= N && N <= 200000);
	for (int i = 1; i <= N; i++) { scanf("%d", &A[i]); assert(0 <= A[i] && A[i] <= 153); }
	for (int i = 1; i <= N - 23; i++) {
		int sum = 0;
		for (int j = i; j <= i + 23; j++) sum += A[j];
		maxn = max(maxn, sum);
	}
	scanf("%d", &Q);
	assert(1 <= Q && Q <= 200000);
	for (int i = 1; i <= Q; i++) {
		int t, v; scanf("%d%d", &t, &v);
		assert(1 <= t && t <= N);
		assert(A[t] <= v && v <= 153);
		A[t] = v;
		for (int j = t - 23; j <= t; j++) {
			int cl = j, cr = j + 23; if (cl <= 0 || cr > N) continue;
			int sum = 0;
			for (int k = cl; k <= cr; k++) sum += A[k];
			maxn = max(maxn, sum);
		}
		printf("%d\n", maxn);
	}
	return 0;
}