poweroj2900

线段树模板题：

#include<bits/stdc++.h>

using namespace std;
//    clock_t start, end;
//    start = clock();
//    end = clock();
//    cout << (double) (end - start) / CLOCKS_PER_SEC << endl;
//ios::sync_with_stdio(false);
#define  int long long
#define rep(i, x, y) for(int i=(x);i<=(y);++i)
#define dep(i, x, y) for(int i=(x);i>=(y);--i)
#define gcd(a, b) __gcd(a,b)
const long long mod = 1e9 + 7;
const int maxn = 1e6 + 10;

int lowbit(int x) { return x & -x; }

bool ispow(int n) { return (n & (n - 1)) == 0; }//O(1) 判断是否是 2^k（2的k次方）

int tsum[maxn << 4], a[maxn];


inline void build(int k, int l, int r) {
    if (l == r) {
        tsum[k] = a[l];
        return;
    }
    int mid = (l + r) >> 1;
    build(k << (int) 1, l, mid);
    build(k << (int) 1 | (int) 1, mid + (int) 1, r);
    tsum[k] = tsum[k << (int) 1] + tsum[k << (int) 1 | (int) 1];
}

int lazy1[maxn << 4], lazy2[maxn << 4];

inline void pushdown(int k, int l, int r) {
    if (l == r) return;
    int mid = (r + l) >> 1;
    int s = (mid + 1 - l) * lazy2[k] + lazy1[k];
    tsum[k << 1 | 1] += (r - mid) * ((int) 2 * s + (r - mid - 1) * lazy2[k]) / (int) 2;
    tsum[k << 1] += (mid + 1 - l) * ((int) 2 * lazy1[k] + (mid - l) * lazy2[k]) / (int) 2;
    lazy1[k << 1] += lazy1[k], lazy2[k << 1] += lazy2[k];

    lazy1[k << 1 | 1] += s, lazy2[k << 1 | 1] += lazy2[k];

    lazy1[k] = lazy2[k] = 0;

}


inline void update(int k, int l, int r, int L, int R, int s, int d) {
    if (L <= l && R >= r) {
        int len = r - l + 1;
        tsum[k] += len * (2 * s + (len - 1) * d) / 2;
        if (l != r) {
            lazy1[k] += s;
            lazy2[k] += d;
        }
        return;
    }
    if (lazy1[k] != 0)
        pushdown(k, l, r);
    int mid = (l + r) >> 1;
    if (L <= mid) {
        update(k << 1, l, mid, L, R, s, d);
    }
    if (R > mid && L <= mid) {
        int w = s + (mid + 1 - L) * d;
        update(k << 1 | 1, mid + 1, r, mid + 1, R, w, d);
    } else if (R > mid && L > mid) {
        update(k << 1 | 1, mid + 1, r, L, R, s, d);
    }

    tsum[k] = tsum[k << 1] + tsum[k << 1 | 1];
    return;
}

inline int quer(int k, int l, int r, int L, int R) {
    int res = 0;
    if (lazy1[k] != 0)
        pushdown(k, l, r);
    if (L <= l && R >= r) {
        return tsum[k];
    }
    int mid = (l + r) >> 1;
    if (L <= mid) {
        res += quer(k << 1, l, mid, L, R);
    }
    if (R > mid) {
        res += quer(k << 1 | 1, mid + 1, r, L, R);
    }
    return res;
}

signed main() {

    int n, q;
    cin >> n >> q;
    for (int i = 1; i <= n; i++) {
        scanf("%lld", &a[i]);
    }
    build(1, 1, n);
    while (q--) {
        int sq;
        scanf("%lld", &sq);
        if (sq == 1) {
            int L, R, s, d;
            scanf("%lld%lld%lld%lld", &L, &R, &s, &d);
            update(1, 1, n, L, R, s, d);
        } else {
            int l, r;
            cin >> l >> r;
            int ans = quer(1, 1, n, l, r);
            printf("%lld\n", ans);

        }
    }

    return 0;
}