// 
#include<bits/stdc++.h>
using namespace std;
using LL=long long;
mt19937_64 myrand(time(NULL));
const int N=200005;
int n,a[N],m;
LL ans[N];
int rt;
struct Query {
    int l,r,x;
}q[N];
struct Node {
    int lc,rc,fa,key;
    LL val,tag;
}tr[N];
inline void cov(int x,LL y) {
    tr[x].val+=y,tr[x].tag+=y;
}
inline void update(int p) {
    tr[tr[p].lc].fa=tr[tr[p].rc].fa=p;
}
inline void pushdown(int p) {
    if (tr[p].lc) cov(tr[p].lc,tr[p].tag);
    if (tr[p].rc) cov(tr[p].rc,tr[p].tag);
    tr[p].tag=0;
}
void split(int p,LL val,int &L,int &R) {
	if (!p) {
		L=0,R=0;
		return;
	}
	pushdown(p);
	if (tr[p].val<val) L=p,split(tr[p].rc,val,tr[L].rc,R);
	else R=p,split(tr[p].lc,val,L,tr[R].lc);
	update(p);
	return;
}
int merge(int p,int q) {
    // cerr<<"OK"<<endl;
	if (!p||!q) return p+q;
    if (tr[p].key<tr[q].key) swap(p,q);
    int x,y;
    split(q,tr[p].val,x,y);
	pushdown(p);
    tr[p].lc=merge(tr[p].lc,x);
    tr[p].rc=merge(tr[p].rc,y);
    update(p);
    return p;
}
void work(int p) {
    if (!p) return;
    work(tr[p].fa);
    pushdown(p);
}
vector<int>add[N],del[N];
int main() {
#ifndef ONLINE_JUDGE
    freopen("in", "r", stdin);
    freopen("out", "w", stdout);
#endif
    scanf("%d",&n);
    for (int i=1;i<=n;i++) scanf("%d",&a[i]);
    scanf("%d",&m);
    for (int i=1;i<=m;i++) {
        scanf("%d %d %d",&q[i].l,&q[i].r,&q[i].x);
        add[q[i].l].push_back(i),del[q[i].r].push_back(i);
    }
    LL B=1000000;
    for (int i=1;i<=n;i++) {
        for (auto x:add[i]) {
            tr[x]={0,0,0,(int)myrand(),B*q[x].x+x,0};
            rt=merge(rt,x);
        }
        int x,y;
        split(rt,B,x,y);
        cov(x,B*a[i]);
        cov(y,-B*a[i]);
        rt=merge(x,y);
        for (auto x:del[i]) {
            work(x);
            // cout<<x<<' '<<tr[x].val<<endl;
            ans[x]=(tr[x].val-x)/B;
        }
    }
    for (int i=1;i<=m;i++) printf("%lld\n",ans[i]);
    return 0;
}

/*

2
3 1
15
1 1 -2
1 1 -1
1 1 0
1 1 1
1 1 2
1 2 -2
1 2 -1
1 2 0
1 2 1
1 2 2
2 2 -2
2 2 -1
2 2 0
2 2 1
2 2 2

*/