#include<bits/stdc++.h> using namespace std; using ll = long long; using VI = vector<ll>; using VV = vector<VI>; using VS = vector<string>; template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; } template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; } #define FOR(i,a,b) for(ll i=(a);i<(b);++i) #define rep(i,b) FOR(i, 0, b) #define ALL(v) (v).begin(), (v).end() #define p(s) cout<<(s)<<endl #define p2(s, t) cout << (s) << " " << (t) << endl #define br() p("") #define pn(s) cout << (#s) << " " << (s) << endl int main(){ cin.tie(0); ios::sync_with_stdio(false); // input ll N; cin >> N; VI A(N); rep(i, N){ cin >> A.at(i); } ll sum = 0; rep(i, 24){ sum += A[i]; } ll ma = sum; // しゃくとり FOR(i, 1, N-24+1){ sum -= A[i-1]; sum += A[i+23]; chmax(ma, sum); } ll Q; cin >> Q; while(Q--){ ll T, V; cin >> T >> V; T--; A[T] = V; ll left = max(T-24+1, 0LL); ll right = min(T + 24-1, N-1-24+1); ll sum = 0; FOR(i, left, left+24){ sum += A[i]; chmax(ma, sum); } // しゃくとり FOR(i, left+1, right+1){ sum -= A[i-1]; sum += A[i+23]; chmax(ma, sum); } p(ma); } return 0; }