线段树板子

#include<bits/stdc++.h>
#define mst(a, b) memset(a, b, sizeof(a))
#define ls(k) (k<<1)
#define rs(k) (k<<1|1)
using namespace std;
struct tree {
	int l, r;
	long long sum;
	long long add;
}dt[2000001];
inline void bul(int l, int r, int k) {
	dt[k].l = l;
	dt[k].r = r;
	dt[k].add = 0;
	if(l == r) {
		int t;
		scanf("%d", &t);
		dt[k].sum = t;
		return;
	}
	int mid = (dt[k].l+dt[k].r) >> 1;
	bul(l, mid, ls(k));
	bul(mid+1, r, rs(k));
	dt[k].sum = dt[ls(k)].sum+dt[rs(k)].sum;
}
inline void pushdown(int k) {
	if(dt[k].add == 0) return;
	dt[ls(k)].add+= dt[k].add;
	dt[rs(k)].add+= dt[k].add;
	dt[ls(k)].sum+= ((long long)(dt[ls(k)].r-dt[ls(k)].l+1))*dt[k].add;
	dt[rs(k)].sum+= ((long long)(dt[rs(k)].r-dt[rs(k)].l+1))*dt[k].add;
	dt[k].add = 0;
}
inline long long query(int l, int r, int k) {
	if(dt[k].l>= l&&dt[k].r<= r) {
		return dt[k].sum;
	} 
	long long mid = (dt[k].l+dt[k].r)  >> 1;
	pushdown(k);
	if(mid>= r) {
		return query(l, r, ls(k));
	} else if(mid<l) {
		return query(l, r, rs(k));
	} else {
		return query(l, mid, ls(k))+query(mid+1, r, rs(k));
	}
}
inline void updatelen(long long l, long long r, long long val, int k) {
	tree &ans = dt[k];
	if(ans.l == l&&ans.r == r) {
		ans.add+= val;
		ans.sum+= (r-l+1)*val;
		return;
	} 
	long long mid = (ans.l+ans.r)  >> 1;
	pushdown(k);
	if(mid>= r) {
		updatelen(l, r, val, ls(k));
	} else if(mid<l) {
		updatelen(l, r, val, rs(k));
	} else {
		updatelen(l, mid, val, ls(k));
		updatelen(mid+1, r, val, rs(k));
	}
	dt[k].sum = dt[ls(k)].sum+dt[rs(k)].sum;
}

int main()
{
	int n, m;
	cin >> n >> m;
	bul(1, n, 1);
	int M = m;
	while(M--) {
		char flag;
		cin >> flag;
		if(flag == 'C') {
			int x, y, k;
			scanf("%d %d %d", &x, &y, &k);
			updatelen(x, y, k, 1);
		} else {
			long long x, y;
			scanf("%lld %lld", &x, &y);
			printf("%lld\n", query(x, y, 1));
		}
	}
	return 0;
}