import sys
input = sys.stdin.readline

def init(N):
    n_ = 1
    while n_ < N:
        n_ *= 2
        n = n_
    arr = [-10 ** 18] * (2*n - 1)
    return n, arr

def update(k, a):
    k += n - 1
    arr[k] = a
    while k > 0:
        k = (k - 1) // 2
        arr[k] = max(arr[2*k + 1], arr[2*k + 2])
        
def query_sub(a, b, k, l, r):
    if r <= a or b <= l:
        return -10 ** 18
        
    if a <= l and r <= b:
        return arr[k]
    else:
        vl = query_sub(a, b, 2*k + 1, l, (l+r) / 2)
        vr = query_sub(a, b, 2*k + 2, (l+r) / 2, r)
        return max(vl, vr)
    
def query(a, b):
    return query_sub(a, b, 0, 0, n)

N = int(input())
A = list(map(int, input().split()))
B = [sum(A[0:24])]

for i in range(1, N-23):
    B.append(B[-1] + A[i+23] - A[i-1])

M = len(B)
n, arr = init(N)

for i in range(M):
    update(i, B[i])

Q = int(input())

for _ in range(Q):
    Ti, Vi = map(int, input().split())
    Ti -= 1
    for i in range(max(Ti-23, 0), min(Ti+1, M)):
        update(i, B[i]-A[Ti]+Vi)
        B[i] = B[i] - A[Ti] + Vi
    A[Ti] = Vi
    print(query(0, M))