#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, ll> LP;

int n,n_,k=0;vector<ll> ts,bucket;


void update(int l,int r,ll d){
  int i=l;
  while(i%k!=0 && i<r){
    //cout << i << endl;
    ts[i]+=d;
    i++;
  }
  while((i+k-1)<r){
    //cout << i << endl;
    bucket[i/k]+=d;
    i+=k;
  }
  while(i<r){
    //cout << i << endl;
    ts[i]+=d;
    i++;
  }
}

ll get(int i){
  if(bucket[i/k]!=0){
    rep(j,k){
      ts[(i/k)*k+j]+=bucket[i/k];
    }
    bucket[i/k]=0;
  }
  return ts[i];
}

void solve(){
  cin >> n;
  n_=n;
  while(k*k<=n){
    k++;
  }
  k++;
  int n_=k*k;
  ts.resize(n_,0);
  bucket.resize(k,0);
  set<int> se={0};
  rep(i,n-1){
    cin >> ts[i]; 
    auto id=se.end();id--;
    if(3*(i-(*id))+ts[*id]<ts[i]) {
      se.insert(i);
    }
  }
  int m;cin >> m;
  rep(i,m){
    int l,r;ll d;
    cin >> l >> r >> d;
    update(l-1,r,d);
    auto id=se.upper_bound(l-1);id--;
    if(3*(i-(*id))+ts[*id]<ts[i]) se.insert(i);
    auto idx=se.end();idx--;
    cout << get(*idx)+3*(n-*idx-1) << endl;
  }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    solve();
}