// yukicoder: No.865 24時間降水量 // 2019.8.16 bal4u #include #if 1 #define gc() getchar_unlocked() #define pc(c) putchar_unlocked(c) #else #define gc() getchar() #define pc(c) putchar(c) #endif int in() { // 非負整数の入力 int n = 0, c = gc(); do n = 10 * n + (c & 0xf); while ((c = gc()) >= '0'); return n; } void out(int n) { // 非負整数の表示(出力) int i; char b[20]; if (!n) pc('0'); else { i = 0; while (n) b[i++] = n % 10 + '0', n /= 10; while (i--) pc(b[i]); } pc('\n'); } //最大キュー #define QSIZE 500000 #define PARENT(i) ((i)>>1) #define LEFT(i) ((i)<<1) #define RIGHT(i) (((i)<<1)+1) typedef struct { int t; } QUE; QUE que[QSIZE+5]; int qsize; void max_heapify(int i) { int l, r, max; l = LEFT(i), r = RIGHT(i); if (l < qsize && que[l].t > que[i].t) max = l; else max = i; if (r < qsize && que[r].t > que[max].t) max = r; if (max != i) { QUE qt = que[i]; que[i] = que[max], que[max] = qt; max_heapify(max); } } void deq() { que[0] = que[--qsize]; max_heapify(0); } void enq(int t) { int i, max; i = qsize++; que[i].t = t; while (i > 0 && que[max = PARENT(i)].t < que[i].t) { QUE qt = que[i]; que[i] = que[max], que[max] = qt; i = max; } } int a[200010]; int N; int s[200010]; int main() { int i, k, d, t, v, Q; N = in(); for (i = 1; i <= N; i++) a[i] = in(); k = 0; for (i = 1; i <= 24; i++) k += a[i]; enq(s[24] = k); for (; i <= N; i++) k += a[i] - a[i-24], enq(s[i] = k); Q = in(); while (Q--) { t = in(), v = in(); d = v-a[t], a[t] = v; for (i = t-23; i < t+24; i++) { if (i >= 0 && i <= N) enq(s[i] += d); } out(que[0].t); } return 0; }