线段树结构体写法+懒惰标记

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e5+1000;
struct node
{
	ll lazy;
	ll sum;
	int l,r;
}tree[N<<4];
int n,m,x,y,val;
ll a[N];
void push_up(int root)
{
	tree[root].sum=tree[root<<1].sum+tree[root<<1|1].sum;
}
void push_down(int root)
{
	if(tree[root].lazy)
	{
		int l=tree[root].l;
		int r=tree[root].r;
		int mid=l+r>>1;
		tree[root<<1].lazy+=tree[root].lazy;
		tree[root<<1|1].lazy+=tree[root].lazy;
		tree[root<<1].sum+=(ll)(mid-l+1)*tree[root].lazy;
		tree[root<<1|1].sum+=(ll)(r-mid)*tree[root].lazy;
	} 
}
void build(int root,int l,int r)
{
	tree[root].l=l;tree[root].r=r;tree[root].lazy=0;
	if(l==r)
	{
		tree[root].sum=a[l];
		return ;
	}
	int mid=l+r>>1;
	build(root<<1,l,mid);
	build(root<<1|1,mid+1,r);
	push_up(root); 
}
ll query(int root,int ql,int qr)
{
	ll res=0;
	int l=tree[root].l;
	int r=tree[root].r;
	if(ql<=l&&r<=qr) return tree[root].sum;
	int mid=l+r>>1;
	push_down(root);
	if(ql<=mid)  res+=query(root<<1,ql,qr);
	if(qr>mid) res+=query(root<<1|1,ql,qr);
	return res;
}
void update(int root,int ql,int qr,int val)
{
	int l=tree[root].l;
	int r=tree[root].r;
	if(ql<=l&&r<=qr) 
	{
		tree[root].sum+=(l-r+1)*val;
		tree[root].lazy+=val;
		return ;
	}
	int mid=l+r>>1;
	push_down(root);
	if(ql<=mid) update(root<<1,ql,qr,val);
	if(qr>mid) update(root<<1|1,ql,qr,val);
	push_up(root); 
}
int main()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++) cin>>a[i];
	build(1,1,n);
	char op;
	while(m--)
	{
		cin>>op;
		if(op=='Q')
		{
			cin>>x>>y;
			cout<<query(1,x,y)<<endl;
		}
		else if(op=='C')
		{
			cin>>x>>y>>val;
			update(1,x,y,val);
		}
	}
}