rt，除了 #1 其他都听取 WA 声一片了（）

代码：

#include <memory.h>

#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int N = 1e5 + 10, INF = 0x3f3f3f3f3f3f3f3f;

long long tr[N * 4], lazy[N * 4], a[N], b[N];
int n, m;

void push_up(int id) { tr[id] = tr[id * 2] + tr[id * 2 + 1]; }

void push_down(int id, int l, int r) {
    if (!lazy[id]) return;
    int mid = (l + r) >> 1;
    lazy[id * 2] += lazy[id];
    lazy[id * 2 + 1] += lazy[id];
    tr[id * 2] += (mid - l + 1) * lazy[id];
    tr[id * 2 + 1] += (r - mid) * lazy[id];
}

void build(int id, int l, int r) {
    if (l == r) {
        tr[id] = b[l];
        return;
    }
    int mid = (l + r) >> 1;
    build(id * 2, l, mid);
    build(id * 2 + 1, mid + 1, r);

    push_up(id);
}

void update(int id, int l, int r, int x, int y, long long v) {
    if (x <= l && y >= r) {
        lazy[id] += v;
        tr[id] += (r - l + 1) * v;
        return;
    }
    int mid = (l + r) >> 1;
    if (x <= mid) {
        update(id * 2, l, mid, x, y, v);
    }
    if (y > mid) {
        update(id * 2 + 1, mid + 1, r, x, y, v);
    }
    push_up(id);
}

long long query(int id, int l, int r, long long x, long long y) {
    if (x <= l && y >= r) {
        return tr[id];
    }
    push_down(id, l, r);
    int mid = (l + r) >> 1;
    long long ans = 0;
    if (x <= mid) {
        ans += query(id * 2, l, mid, x, y);
    }
    if (y > mid) {
        ans += query(id * 2 + 1, mid + 1, r, x, y);
    }
    return ans;
}

int main() {
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    for (int i = 1; i <= n; i++) {
        b[i] = a[i] - a[i - 1];
    }
    build(1, 1, n);
    for (int i = 1; i <= m; i++) {
        int opt, l, r, k, d, p;
        cin >> opt;
        if (opt == 1) {
            cin >> l >> r >> k >> d;
            update(1, 1, n, l, l, k);
            if (l + 1 <= r) update(1, 1, n, l + 1, r, d);
            if (r < n) update(1, 1, n, r + 1, r + 1, -(k + d * (r - l)));
        } else {
            cin >> p;
            cout << query(1, 1, n, 1, p) << endl;
        }
    }
    return 0;
}

谢谢大佬们qwq