能过小样例。但是交上去会 0pts 全 WA。

磕头了。/kel

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 2e5 + 50;
#define ll long long
#define mid (l + r >> 1)
int n, q;
ll w;
ll a[maxn], tim = 0, cnt;
ll pow[maxn],pre[maxn];
struct segmentTree
{
    ll tr[maxn << 2], tag[maxn << 2];
    void pushup(int k)
    {
        tr[k] = tr[k << 1] + tr[k << 1 | 1];
    }
    void build(int k, int l, int r)
    {
        if (l == r)
            return tr[k] = a[l], void();
        build(k << 1, l, mid);
        build(k << 1 | 1, mid + 1, r);
        pushup(k);
    }
    void pushdown(int k, int l, int r)
    {
        if (!tag[k])
            return;
        tag[k << 1] += tag[k];
        tag[k << 1 | 1] += tag[k];
        tr[k << 1] += (mid - 1 + 1) * tag[k];
        tr[k << 1 | 1] += (r - mid) * tag[k];
        tag[k] = 0;
    }
    void modify(int k, int l, int r, int x, int y, ll val)
    {
        if (r < x || l > y)
            return;
        if (x <= l && r <= y)
        {
            tr[k] += val * (r - l + 1);
            tag[k] += val;
            return;
        }
        pushdown(k, l, r);
        if (x <= mid)
            modify(k << 1, l, mid, x, y, val);
        if (y > mid)
            modify(k << 1 | 1, mid + 1, r, x, y, val);
        pushup(k);
        return;
    }
    int query(int k, int l, int r, ll val)
    {
        if (l == r)
            return (val > tr[k] * pow[tim]) ? r : r - 1;
        pushdown(k, l, r);
        if (val > tr[k << 1] * pow[tim])
            return query(k << 1 | 1, mid + 1, r, val - tr[k << 1] * pow[tim]);
        else
            return query(k << 1, l, mid, val);
    }
} Aya;
int solve(int l, int r, ll d)
{
    Aya.modify(1, 1, n, l, r, d);
    int tot = lower_bound(pre, pre + n, ((long double)w/(long double)cnt)) - pre - 1;
    tim = tot; // 重复进行的游戏轮数
    int ans = tot * n + Aya.query(1, 1, n, w - pre[tot] * cnt);
    return ans;
}
signed main()
{
    // freopen("wxyt2.in","r",stdin);
    // freopen("bin.out","w",stdout);
    scanf("%d%d%lld", &n, &q, &w);
    pow[0] = 1;
    pre[0] = 0;
    for (int i = 1; i <= n; i++)
        scanf("%lld", &a[i]), cnt += a[i];
    Aya.build(1, 1, n);
    for (int i = 1; i < n; i++)
        pow[i] = pow[i - 1] << 1, pre[i] = pre[i - 1] + pow[i - 1];
    for (int i = 1; i <= q; i++)
    {
        int l, r;
        ll d;
        scanf("%d%d%lld", &l, &r, &d);
        cnt += (r - l + 1) * d;
        printf("%d\n", solve(l, r, d));
    }
    // fclose(stdin);
    // fclose(stdout);
    return 0;
}