#include <bits/stdc++.h>
using namespace std;

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

template<typename T> T fl(T x, T y) { return x / y; }
template<typename T> T ce(T x, T y) { return (x + y - 1) / y; }

LL n, t[100000], m;
const int S = 320;
LL os[S];
pair<LL, int> p[S];

void full(int b, LL d) {
	os[b] += d;
	p[b].FI += d;
}

void part(int l, int r, LL d) {
	int b = l / S;
	int L = b * S;
	int R = L + S;
	
	incID(i, L, R) { t[i] += os[b]; }
	os[b] = 0;
	
	incII(i, l, r) { t[i] += d; }
	
	auto ans = MP(-1LL, -1);
	incID(i, L, R) { setmax(ans, MP(t[i], i)); }
	
	setmax(p[b], ans);
}

LL update(int l, int r, LL d) {
	if(l / S == r / S) { part(l, r, d); }	
	else {
		int x = ce(l, S) * S;
		int y = fl(r, S) * S;
		
		part(l, x - 1, d);
		incID(i, x / S, y / S) { full(i, d); }
		part(y, r, d);
	}
	
	auto ans = MP(-1LL, 0);
	inc(i, S) { setmax(ans, p[i]); }
	
	return (3 * (n - 1) + (ans.FI));
}

int main() {
	cin >> n;
	inc(i, n - 1) { cin >> t[i]; }
	
	inc(i, n) { t[i] -= i * 3; }
	inc(i, n) { setmax(p[i / S], MP(t[i], i)); }
	
	cin >> m;
	inc(q, m) {
		LL l, r, d;
		cin >> l >> r >> d;
		l--; r--;
		cout << update(l, r, d) << "\n";
	}
	
	return 0;
}