why RE?

#include<bits/stdc++.h>
#define ll long long
#define lc c<<1
#define rc c<<1|1
using namespace std;
struct N{
    ll l,r;
    ll lazy,maxs,d;
    ll add;
} tr[1000005];
ll n,q,w;
ll a[200005];
ll f[100];
void init(){
    f[0] = 1;
    for(int i=1;f[i-1] * 2 <= 1e18 && f[i-1] * 2 >= 0;i++) f[i] = f[i-1] * 2;
}
void push_down(ll c){
    if(tr[c].d != 0){
        ll l = tr[c].l , r = tr[c].r;
        ll mid = l + r >> 1;
        tr[lc].lazy += tr[c].lazy;
        tr[rc].lazy += (tr[c].lazy + (mid + 1 - l) * tr[c].d);
        tr[lc].d += tr[c].d , tr[rc].d += tr[c].d;
        tr[lc].maxs += (tr[c].lazy + (mid - l) * tr[c].d);
        tr[rc].maxs += (tr[c].lazy + (r - l) * tr[c].d);
    }
    if(tr[c].add != 0){
        tr[lc].add += tr[c].add , tr[rc].add += tr[c].add;
        tr[lc].maxs += tr[c].add , tr[rc].maxs += tr[c].add;
    }
    tr[c].d = 0 , tr[c].lazy = 0;
    tr[c].add = 0;
}
void build(ll c,ll l,ll r){
    tr[c].l = l , tr[c].r = r;
    if(l == r){
        tr[c].maxs = a[l];
        return ;
    }
    ll mid = l + r >> 1;
    build(lc,l,mid);
    build(rc,mid+1,r);
    tr[c].maxs = max(tr[lc].maxs,tr[rc].maxs);
}
void update(ll c,ll l,ll r,ll k){
    if(l <= tr[c].l && tr[c].r <= r){
        tr[c].lazy += (tr[c].l - l + 1) * k;
        tr[c].maxs += (tr[c].r - l + 1) * k;
        tr[c].d += k;
        return ;
    }
    push_down(c);
    ll mid = tr[c].l + tr[c].r >> 1;
    if(l <= mid) update(lc,l,r,k);
    if(mid + 1 <= r) update(rc,l,r,k);
    tr[c].maxs = max(tr[lc].maxs,tr[rc].maxs);
}
void add(ll c,ll l,ll r,ll k){
    if(l <= tr[c].l && tr[c].r <= r){
        tr[c].add += k;
        tr[c].maxs += k;
        return ;
    }
    push_down(c);
    ll mid = tr[c].l + tr[c].r >> 1;
    if(l <= mid) add(lc,l,r,k);
    if(mid + 1 <= r) add(rc,l,r,k);
    tr[c].maxs = max(tr[lc].maxs,tr[rc].maxs);
}
ll query(ll c,ll k,ll ept){
    if(tr[c].l == tr[c].r){
        return tr[c].l;
    }
    push_down(c);
    if(k <= tr[lc].maxs * f[ept]) return query(lc,k,ept);
    else query(rc,k,ept);
}
ll get_num(ll c,ll k){
    if(tr[c].l == tr[c].r){
        return tr[c].maxs;
    }
    push_down(c);
    ll mid = tr[c].l + tr[c].r >> 1;
    if(k <= mid) return get_num(lc,k);
    else return get_num(rc,k);
}
ll l,r,d;
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    init();
    cin>>n>>q>>w;
    for(int i=1;i<=n;i++) cin>>a[i],a[i] += a[i-1];
    ll sum = a[n];
    build(1,1,n);
    while(q--){
        cin>>l>>r>>d;
        update(1,l,r,d);
        if(r != n) add(1,r+1,n,(r - l + 1) * d);
        sum += (r - l + 1) * d;
        ll ans = (ll)(log2(w * 1.0 / sum + 1));
        cout<<ans * n + (w - (f[ans] - 1) * sum ? query(1,w - (f[ans] - 1) * sum,ans) : 0) - 1<<endl;
    }
    return 0;
}
/*

1 2 4 8 

第x轮
(2^x - 1) * sum  <= w

*/