#include using namespace std; typedef long long ll; typedef pair p_ll; template void debug(T itr1, T itr2) { auto now = itr1; while(now=0; i--) const ll MOD = pow(10,9)+7; const ll LLINF = pow(2,61)-1; const int INF = pow(2,30)-1; vector fac; void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; } ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; } ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; } ll gcd(ll a, ll b) { if (a> N; ll A[N]; rep(i,N) cin >> A[i]; ll rn = N-23; ll range[rn] = {}; rep(i,rn) { if (i==0) rep(j,24) range[i] += A[j]; else range[i] = range[i-1] + A[i+23] - A[i-1]; } debug(range,range+rn); ll ma = *max_element(range,range+rn); ll Q; cin >> Q; rep(_,Q) { ll T, V; cin >> T >> V; T--; ll diff = V - A[T]; A[T] = V; repr(i,max(0ll,T-23),min(rn,T+1)) { range[i] += diff; ma = max(ma, range[i]); } cout << ma << endl; } return 0; }