线段树区间加(区间查询)

243. 一个简单的整数问题2 - AcWing题库

#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
const int N=100010;
int n,m;
int w[N];
struct node{
	int l,r,sum,add;//总和,区间gcd
}tr[N*4];
void pushup(int u){
	tr[u].sum=tr[u*2].sum+tr[u*2+1].sum;
}
void build(int u,int l,int r){
	tr[u]={l,r};
	if(l==r){
		tr[u].sum=w[l];
		tr[u].add=0;
		return;
	}
	int mid=(l+r)/2;
	build(u*2,l,mid);
	build(u*2+1,mid+1,r);
	pushup(u);	
}
void pushdown(int u,int x){
	tr[u].sum+=(tr[u].r-tr[u].l+1)*x;
	tr[u].add+=x;
}
void pushdown(int u){
	if(tr[u].add==0) return;
	pushdown(u*2,tr[u].add);
	pushdown(u*2+1,tr[u].add);
	tr[u].add=0;
}
void change(int u,int l,int r,int x){
	if(l<=tr[u].l&&tr[u].r<=r){//找到根节点
		tr[u].sum+=(tr[u].r-tr[u].l+1)*x;
		tr[u].add+=x;
		return;
	}
	pushdown(u);
	int mid=(tr[u].l+tr[u].r)/2;
	if(l<=mid) change(u*2,l,r,x);
	if(r>mid) change(u*2+1,l,r,x);
	pushup(u);
}
int 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)/2;
	int sum=0;
	if(l<=mid) sum=query(u*2,l,r);
	if(r>mid) sum+=query(u*2+1,l,r);
	return sum;
}
void solve()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		cin>>w[i];
	}
	build(1,1,n);
	//return;
	while(m--){
	char s;int l,r;
	  cin>>s>>l>>r;
		if(s=='C'){
			int d;cin>>d;
			change(1,l,r,d);
		}
		else{
			cout<<query(1,l,r)<<endl;
		}
	}
}
signed main()
{
	ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
	solve();
	return 0;
}