BZOJ 3212【Pku 3468】A Simple Problem with Integers==线段树裸题

题目传送：23333

直接建树，区间修改可以打永久标记，查询直接查就可以了。

记得要开long long==我不知道不开会不会WA反正我开了

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#define rep(j,k,l) for (long long j=k;j<=l;j++)

using namespace std;
long long a[111111],tr[2222222],flag[2222222];

void setree(long long k,long long l,long long r){

if (l==r){

tr[k]=a[l];
return;

}
setree(2*k,l,(l+r)/2);
setree(2*k+1,(l+r)/2+1,r);
tr[k]=tr[2*k]+tr[2*k+1];

}

long long ask(long long k,long long l,long long r,long long o,long long p,long long f){

if (r<o||p<l) return 0;
f+=flag[k];
if (o<=l&&r<=p) return tr[k]+(r-l+1)*f;
return ask(2*k,l,(l+r)/2,o,p,f)+ask(2*k+1,(l+r)/2+1,r,o,p,f);

}

void change(long long k,long long l,long long r,long long o,long long p,long long j){

if (r<o||p<l) return;
if (o<=l&&r<=p){

flag[k]+=j;
return;

}
change(2*k,l,(l+r)/2,o,p,j);
change(2*k+1,(l+r)/2+1,r,o,p,j);
tr[k]+=j*(min(r,p)-max(l,o)+1);

}

int main(){

long long n,m;
scanf("%lld%lld",&n,&m);
rep(i,1,n) scanf("%lld",&a[i]);
setree(1,1,n);
while (m--){

char ch=getchar();
while (ch!='Q'&&ch!='C') ch=getchar();
if (ch=='Q'){

long long k,l;
scanf("%lld%lld",&k,&l);
printf("%lld\n",ask(1,1,n,k,l,0));

}
else{

long long j,k,l;
scanf("%lld%lld%lld",&k,&l,&j);
change(1,1,n,k,l,j);

}

}

}