树状数组

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

void change1(int x,int d)     //单点修改
{
    for (int i = x; i <= n; i += lowbit(i)) {
        c[i] += d;
    }
}

int sum1(int x)     ///区间查询
{
    if (!x) {
        return 0;
    }
    int res = 0;
    for (int i = x; i; i -= lowbit(i)) {
        res += c[i];
    }
    return res;
}

void change2(int x,int d)        //区间修改
{
    for (int i=x;i;i-=lowbit(i)){
        c[i]+=d;
    }
}

void sum2(int x)   //单点查询
{
    if (!x) {
        return 0;
    }
    int res;
    for (int i = x; i <= n; i += lowbit(i)) {
        res += c[i];
    }
    return res;
}






int main() {
    for (int i=1;i<=n;i++) {
        scanf("%d", &a[i]);
        change3(c, i, a[i] - a[i - 1]);
        change3(d, i, (a[i] - a[i - 1]) * (i - 1));
    }
    for (int i=1;i<=m;i++) {
        scanf("%d", &x);
        if (x == 1) {
            scanf("%d%d%d", &a, &b, &c);
            change3(c, a, c);
            change3(c, b + 1, -c);
            change3(d, a, (a - 1) * c);
            change3(d, b + 1, -b * c);
        } else {
            scanf("%d%d", &a, &b);
            t1 = sum3(c, a - 1) * (a - 1) - sum3(d, a - 1);
            t2 = sum3(c, b) * b - sum3(d, b);
            printf("%d
", t2 - t1);
        }
    }
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &a);
        change1(i, a);
    }
    for (int i = 1; i <= m; i++) {
        scanf("%d%d%d", &a, &b, &c);
        if (a == 1) {
            change1(b, c);   //单点修改
        } else {
            printf("%d
", sum1(c) - sum1(b - 1));//区间查询
        }
    }
}