A Simple Problem with Integers-线段树模板(入门)

You have N integers, A1, A2, … , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interval. The other is to ask for the sum of numbers in a given interval.

Input
The first line contains two numbers N and Q. 1 ≤ N,Q ≤ 100000.
The second line contains N numbers, the initial values of A1, A2, … , AN. -1000000000 ≤ Ai ≤ 1000000000.
Each of the next Q lines represents an operation.
“C a b c” means adding c to each of Aa, Aa+1, … , Ab. -10000 ≤ c ≤ 10000.
“Q a b” means querying the sum of Aa, Aa+1, … , Ab.

Output
You need to answer all Q commands in order. One answer in a line.

Sample Input
10 5
1 2 3 4 5 6 7 8 9 10
Q 4 4
Q 1 10
Q 2 4
C 3 6 3
Q 2 4
Sample Output
4
55
9
15
Hint
The sums may exceed the range of 32-bit integers.

思路
线段树模板题,在更新区间值时使用lazy来暂时不更新，当查询到该区间和的时候再更新。注意输入N个数的值的范围 -1000000000 ≤ Ai ≤ 1000000000，如果算区间和会爆int，要用long long

#include<iostream>
#include<cstdio>
#include<string> 
#define maxn 110000
typedef long long ll;
using namespace std;
int val,data[maxn];
ll sum;
struct Node{
	ll lazy,sum;//lazy,sum都要用long long
	int l,r;
}node[maxn*4];
void build(int k,int l,int r)
{
	node[k].l=l;
	node[k].r=r;
	node[k].lazy=0;
	if(l==r) 
	{
		node[k].sum=data[l];
		return;
	}
	else
	{
		int m=(node[k].l+node[k].r)/2;
		build(2*k,l,m);//建左树 
		build(2*k+1,m+1,r);//建右树 
		node[k].sum=node[2*k].sum+node[2*k+1].sum;//更新自己的区间和 
	}
}
void removeLazy(int k)
{
	if(node[k].lazy!=0)//如果当前区间有待更新的懒惰值 
	{
		node[2*k].lazy+=node[k].lazy;//更新左边的子区间的懒惰值 
		node[2*k+1].lazy+=node[k].lazy;//更新右边的子区间的懒惰值 
		node[2*k].sum+=node[k].lazy*(node[2*k].r-node[2*k].l+1);//新总和=总和+懒惰值 
		node[2*k+1].sum+=node[k].lazy*(node[2*k+1].r-node[2*k+1].l+1);
		node[k].lazy=0;//已经更新，remove掉k节点的懒惰值 
	}
}
void update(int k,int l,int r)
{
	if(node[k].l==l&&node[k].r==r)
	{
		node[k].lazy+=val;
		node[k].sum+=val*(r-l+1);
		return;
	}
	if(node[k].l==node[k].r)
		return;
	removeLazy(k);
	int m=(node[k].l+node[k].r)/2;
	if(r<=m)
		update(2*k,l,r);
	else if(l>m)
		update(2*k+1,l,r);
	else
	{
		update(2*k,l,m);
		update(2*k+1,m+1,r);
	}
	node[k].sum=node[2*k].sum+node[2*k+1].sum;
}
ll query(int k,int l,int r)
{
	if(node[k].l==l&&node[k].r==r)
		return node[k].sum;
	removeLazy(k);
	ll res=0;
	int m=(node[k].l+node[k].r)/2;
	if(r<=m)
		res+=query(2*k,l,r);
	else if(l>m)
		res+=query(2*k+1,l,r);
	else
	{
		res+=query(2*k,l,m);
		res+=query(2*k+1,m+1,r);
	}
	return res;
}
int main()
{
	int n,nReq;
	scanf("%d %d",&n,&nReq);
	for(int i=1;i<=n;i++)
		scanf("%d",&data[i]);
	build(1,1,n);//建树 
	string req;
	int x,y,k;
	while(nReq--)
	{
		cin >> req;
		if(req=="Q")
		{
			scanf("%d %d",&x,&y);
			printf("%lld\n",query(1,x,y));
		}
		else
		{
			scanf("%d %d %d",&x,&y,&val);
			update(1,x,y);
		}
	}
}