#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
#define pq priority_queue
#define P pair<int,int>
#define P2 pair<int,P>
#define P3 pair<int,P2>
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,-1,0,-1,1,0,0};
const ll LINF=1e18;
const ld PI=abs(acos(-1));
int n,m,q,a,b,c;

struct SegmentTree{
	int sz;
	vector<ll> seg;
	vector<ll> lazy;
	
	SegmentTree(int n){
		sz = 1;
		while(sz<n) sz*=2;
		seg.assign(sz*2, unit());
		lazy.assign(sz*2, 0);
	}
	
	void update(int k,int x){
		k += sz-1;
		seg[k] = x;
		while(k){
			k = (k-1)/2;
			seg[k] = max(seg[2*k+1], seg[2*k+2]);
		}
	}
	
	void push(int k){
		if(k < sz-1){
			lazy[2*k+1] += lazy[k];
			lazy[2*k+2] += lazy[k];
		}
		
		seg[k] += lazy[k];
		lazy[k] = 0;
	}
	
	ll get(int a,int b){
		return _get(a,b,0,0,sz);
	}
	
	ll _get(int a,int b,int k,int l,int r){
		push(k);
		if(b<=l||r<=a) return unit();
		if(l<=a&&b<=r) return seg[k];
		
		return max(_get(a,b,2*k+1,l,(l+r)/2), _get(a,b,2*k+2,(l+r)/2,r));
	}
	
	int add(int a,int b,int x){
		return _add(a,b,0,0,sz,x);
	}
	
	int _add(int a,int b,int k,int l,int r,int x){
		push(k);
		if(b<=l||r<=a) return 0;
		if(a<=l&&r<=b){
			lazy[k] += x;
			push(k);
			return 0;
		}
		
		_add(a,b,2*k+1,l,(l+r)/2,x);
		_add(a,b,2*k+2,(l+r)/2,r,x);
		seg[k] = max(seg[2*k+1], seg[2*k+2]);
		return 0;
	}
	
	int unit(){
		return 0;
	}
};

int main(){
	cin >> n;
	SegmentTree seg(n);
	REP(i,0,n-1){
		cin >> a;
		seg.update(i,3*(n-i-1)+a);
	}
	cin >> m;
	REP(i,0,m){
		cin >> a >> b >> c;
		seg.add(a-1,b,c);
		cout << seg.get(a-1,b) << endl;
	}
	return 0;
}