#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
int n, q;
int a[N], pre[N];
int maxn = INT_MIN;
int main()
{
    scanf("%d", &n);
    for (int i = 1; i <= n; ++ i )
    {
        scanf("%d", &a[i]);
        pre[i] = pre[i - 1] + a[i];
    }
    scanf("%d", &q);
    for (int i = 1; i <= n - 23; ++ i )
    {
        int last = pre[i + 23] - pre[i - 1];
        maxn = max(maxn, last);
    }
    // cout << "maxn = " << maxn << endl;
    while (q -- )
    {
        int id, idx;
        scanf("%d%d", &id, &idx);
        a[id] = idx;
        for (int i = id - 23; i <= id; ++ i)
        {
            int xx = 0;
            if (i < 1 || i > n || i + 23 < 1 || i + 23 > n) continue;
            for (int j = i; j <= i + 23; ++ j )
            {
                xx += a[j];
            }
            maxn = max(maxn, xx);
        }
        cout << maxn << endl;
    }
    return 0;
}