#include <iostream>
#include <numeric>
#include <vector>

constexpr int D = 24;

void solve() {
    int n;
    std::cin >> n;

    std::vector<int> xs(n);
    for (auto& x : xs) std::cin >> x;

    auto getsum = [&](int i) {
        if (i < 0 || i + D > n) return 0;
        return std::accumulate(xs.begin() + i, xs.begin() + i + D, 0);
    };

    int max = 0;
    for (int i = 0; i + D <= n; ++i) {
        max = std::max(max, getsum(i));
    }

    int q;
    std::cin >> q;
    while (q--) {
        int t, v;
        std::cin >> t >> v;
        xs[--t] = v;

        for (int i = t - D; i <= t; ++i) {
            max = std::max(max, getsum(i));
        }
        std::cout << max << "\n";
    }
}

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

    solve();

    return 0;
}