题意:
给n个整数,求两种操作:1.给一个区间的数都加上一个数 2.查询一个区间的数的和 ,输出每次查询的结果
线段树区间求和,注意点:
1.使用lazy操作pushdown的时候,应该是子节点的lazy值加上父节点的lazy值,而不是直接赋值成父节点的lazy值,因为子节点可能之前也被操作过
2.节点的sum求和的时候应该加上区间的和(虽然直接加上修改值也能过样例TAT)
3.sum应该用long long
代码:
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include<climits>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <bitset>
#include <list>
#include <stdexcept>
#include <functional>
#include <utility>
#include <ctime>
using namespace std;
#define PB push_back
#define MP make_pair
#define REP(i,x,n) for(int i=x;i<(n);++i)
#define FOR(i,l,h) for(int i=(l);i<=(h);++i)
#define FORD(i,h,l) for(int i=(h);i>=(l);--i)
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define RI(X) scanf("%d", &(X))
#define RII(X, Y) scanf("%d%d", &(X), &(Y))
#define RIII(X, Y, Z) scanf("%d%d%d", &(X), &(Y), &(Z))
#define DRI(X) int (X); scanf("%d", &X)
#define DRII(X, Y) int X, Y; scanf("%d%d", &X, &Y)
#define DRIII(X, Y, Z) int X, Y, Z; scanf("%d%d%d", &X, &Y, &Z)
#define OI(X) printf("%d",X);
#define RS(X) scanf("%s", (X))
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
#define Swap(a, b) (a ^= b, b ^= a, a ^= b)
#define Dpoint strcut node{int x,y}
#define cmpd int cmp(const int &a,const int &b){return a>b;}
/*#ifdef HOME
freopen("in.txt","r",stdin);
#endif*/
const int MOD = 1e9+7;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<double> VD;
typedef long long LL;
typedef pair<int,int> PII;
//#define HOME
int Scan()
{
int res = 0, ch, flag = 0;
if((ch = getchar()) == '-') //判断正负
flag = 1;
else if(ch >= '0' && ch <= '9') //得到完整的数
res = ch - '0';
while((ch = getchar()) >= '0' && ch <= '9' )
res = res * 10 + ch - '0';
return flag ? -res : res;
}
/*----------------PLEASE-----DO-----NOT-----HACK-----ME--------------------*/
long long int sum[400000+10];
long long int lazy[400000+10];
void pushup(int rt)
{
sum[rt]=sum[rt<<1]+sum[(rt<<1)+1];
}
void pushdown(int rt,int length)
{if(lazy[rt]!=0)
{ if(length%2==0)
{sum[rt<<1]+=lazy[rt]*(length/2);
sum[(rt<<1)+1]+=lazy[rt]*(length/2);}
else
{
sum[rt<<1]+=lazy[rt]*(length/2+1);
sum[(rt<<1)+1]+=lazy[rt]*(length/2);
}
lazy[(rt<<1)+1]+=lazy[rt];
lazy[rt<<1]+=lazy[rt];
lazy[rt]=0;
}
}
void build(int l,int r,int rt)
{
if(l==r)
{
scanf("%I64d",&sum[rt]);
return;
}
int m=(l+r)>>1;
build(l,m,rt<<1);
build(m+1,r,(rt<<1)+1);
pushup(rt);
}
void update(int l,int r,int rt,int a,int b,int c)
{if(a<=l&&r<=b)
{
sum[rt]+=(r-l+1)*c;
lazy[rt]+=c;
return;
}
pushdown(rt,r-l+1);
int m=(l+r)>>1;
if(a<=m)
update(l,m,rt<<1,a,b,c);
if(b>m)
update(m+1,r,(rt<<1)+1,a,b,c);
pushup(rt);
}
long long int query(int l,int r,int rt,int a,int b)
{
if(a<=l&&r<=b)
{
return sum[rt];
}
pushdown(rt,r-l+1);
long long int ans=0;
int m=(l+r)>>1;
if(a<=m)
{
ans+=query(l,m,rt<<1,a,b);
}
if(b>m)
{
ans+=query(m+1,r,(rt<<1)+1,a,b);
}
pushup(rt);
return ans;
}
int main()
{
int n,q;
RII(n,q);
MS0(sum);
build(1,n,1);
MS0(lazy);
for(int i=0;i<q;i++)
{
getchar();
char o;
scanf("%c",&o);
if(o=='C')
{int a,b,c;
RIII(a,b,c);
update(1,n,1,a,b,c);
}
else
if(o=='Q')
{
int a,b;
RII(a,b);
printf("%I64d\n",query(1,n,1,a,b));
}
}
return 0;
}