#include <queue>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(false);
	int N, Q;
	cin >> N;
	vector<int> A(N);
	for (int i = 0; i < N; ++i) cin >> A[i];
	vector<int> sum(N - 23);
	int ans = 0;
	for (int i = 0; i < N - 23; ++i) {
		for (int j = 0; j < 24; ++j) {
			sum[i] += A[i + j];
		}
		ans = max(ans, sum[i]);
	}
	cin >> Q;
	for (int i = 0; i < Q; ++i) {
		int T, V;
		cin >> T >> V; --T;
		for (int j = T - 23; j <= T; ++j) {
			if (0 <= j && j < N - 23) {
				sum[j] += V - A[T];
				ans = max(ans, sum[j]);
			}
		}
		cout << ans << '\n';
	}
	return 0;
}