#include <bits/stdc++.h>
using namespace std;
inline long long int modadd(long long int n, long long int m,
                            long long int p = 1000000007) {
  return ((n + m) % p + p) % p;
}
inline long long int modsub(long long int n, long long int m,
                            long long int p = 1000000007) {
  return ((n - m + p) % p + p) % p;
}
inline long long int modpro(long long int n, long long int m,
                            long long int p = 1000000007) {
  return (((n % p) * (m % p)) % p + p) % p;
}
unsigned long long int powe(long long int first, long long int second) {
  unsigned long long int res = 1;
  while (second > 0) {
    if (second & 1) res = res * first;
    second = second >> 1;
    first = first * first;
  }
  return res;
}
long long int modpow(long long int first, long long int second,
                     long long int p = 1000000007) {
  long long int res = 1;
  while (second > 0) {
    if (second & 1) res = modpro(res, first, p);
    second = second >> 1;
    first = modpro(first, first, p);
  }
  return res;
}
inline long long int modInverse(long long int n, long long int p = 1000000007) {
  if (n == 1) return 1;
  return modpow(n, p - 2, p);
}
inline long long int moddiv(long long int n, long long int m,
                            long long int p = 1000000007) {
  return modpro(n, modInverse(m, p), p);
}
inline long long int modadd3(long long int first, long long int second,
                             long long int z, long long int p = 1000000007) {
  return modadd(modadd(first, second, p), z, p);
}
inline long long int modadd4(long long int first, long long int second,
                             long long int z, long long int w,
                             long long int p = 1000000007) {
  return modadd(modadd(first, second, p), modadd(z, w, p), p);
}
inline long long int modnCr(long long int fac[], int n, int r,
                            long long int p = 1000000007) {
  if (r == 0) return 1;
  return modpro(fac[n], modInverse(modpro(fac[r], fac[n - r], p), p), p);
}
template <typename T>
void printArr(T *arr, int s, int n) {
  for (int i = s; i <= n; i++) {
    cout << arr[i] << " ";
  }
  cout << endl;
}
long long int a[200005], diff[200005];
long long int f(long long int first, long long int second) {
  long long int sum = first + second;
  if (sum >= 0) return (sum + 1) / 2;
  sum = -sum;
  return -(sum / 2);
}
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  int erer = 1;
  for (int erer2 = (1); erer2 < (erer + 1); erer2++) {
    int n;
    cin >> n;
    for (int i = (0); i < (n); i++) cin >> a[i];
    long long int ff = a[0];
    for (int i = (0); i < (n - 1); i++) diff[i] = a[i + 1] - a[i];
    long long int ans = 0;
    for (int i = (0); i < (n - 1); i++)
      if (diff[i] > 0) ans += diff[i];
    cout << f(ans, a[0]) << endl;
    int q;
    cin >> q;
    for (int i = (0); i < (q); i++) {
      int l, r, first;
      cin >> l >> r >> first;
      l--;
      r--;
      if (l == 0)
        ff += first;
      else {
        if (diff[l - 1] > 0) ans -= (diff[l - 1]);
        diff[l - 1] += first;
        if (diff[l - 1] > 0) ans += (diff[l - 1]);
      }
      if (r < n - 1) {
        if (diff[r] > 0) ans -= (diff[r]);
        diff[r] -= first;
        if (diff[r] > 0) ans += (diff[r]);
      }
      cout << f(ff, ans) << endl;
    }
  }
  return 0;
}
