洛谷P3372(线段树)

利用线段树维护区间加和区间和(懒标记做法即可)

#include<bits/stdc++.h>
#define ll long long
#define ls u<<1
#define rs u<<1|1
using namespace std;
const int maxn = 1e5 + 5;
struct Segtree{
	int l,r;
	ll sum,laz;
}tr[maxn << 2];
int a[maxn];
void pushup(int u){
	tr[u].sum = tr[ls].sum + tr[rs].sum;
}
void pushdown(int u){
	if(tr[u].laz){
		tr[ls].sum += tr[u].laz*(tr[ls].r - tr[ls].l + 1);
		tr[rs].sum += tr[u].laz*(tr[rs].r - tr[rs].l + 1);
		tr[ls].laz += tr[u].laz;
		tr[rs].laz += tr[u].laz;
		tr[u].laz = 0;
	}
}
void build(int u, int l, int r){
	tr[u].l = l,tr[u].r = r;
	if(l == r){
		tr[u].sum = a[l];
		return ;
	}
	int mid = l + r >> 1;
	build(ls, l, mid);
	build(rs, mid+1, r);
	pushup(u);
}
void update(int u, int l, int r, ll d){
	if(tr[u].l >= l && tr[u].r <= r){
		tr[u].sum += d*(tr[u].r - tr[u].l + 1);
		tr[u].laz += d;
		return ;
	}
	pushdown(u);
	int mid = tr[u].l + tr[u].r >> 1;
	if(l <= mid)update(ls, l, r, d);
	if(r > mid)update(rs, l, r, d);
	pushup(u);
}
ll query(int u, int l, int r){
	if(tr[u].l >= l && tr[u].r <= r)return tr[u].sum;
	pushdown(u);
	int mid = tr[u].l + tr[u].r >> 1;
	ll res = 0;
	if(l <= mid)res += query(ls, l, r);
	if(r > mid)res += query(rs, l, r);
	return res;
}
int main(){
	int n,m;
	cin >> n >> m;
	for(int i = 1; i <= n; i++)cin >> a[i];
	build(1, 1, n);
	while(m--){
		int op,l,r;
		cin >> op >> l >> r;
//		cout << "op = " << op << " l = " << l << " r = " << r << endl;
		if(op == 1){
			ll d;
			cin >> d;
			update(1, l, r, d);
		}else{
			cout << query(1, l, r) << endl;
		}
	}
}