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.
题目的意思是给出一串数,然后对这串数进行一系列操作,
Q 意思是求和,求a区间到b区间的和,
C 的意思是使区间a到区间b加上一个数c。
这一题有懒惰标记,其实这是我比较容易忘的地方,所以我还是比较喜欢单个数的相加减,这样就不需要懒惰标记了;
懒惰标记的意义是节省代码运算的时间
#include<stdio.h>
#include<string.h>
long long Sum[500010],add[500010];
void build(int l,int r,int o)
{
if(l==r)
{
scanf("%lld",&Sum[o]);
return;
}
int mid=(l+r)>>1;
build(l,mid,o<<1);
build(mid+1,r,o<<1|1);
Sum[o]=Sum[o<<1]+Sum[o<<1|1];
}
void pushdown(int o,int l)//更新懒惰标记
{
if(add[o])
{
add[o<<1]+=add[o];
add[o<<1|1]+=add[o];//将懒惰标记传到下一行
Sum[o<<1]+=add[o]*(l-(l>>1));//将下一行的数更新
Sum[o<<1|1]+=add[o]*(l>>1);
add[o]=0;//传完后,结束这个标记。
}
}
void update(int x,int y,int l,int r,int o,int c)
{
if(l>=x&&r<=y)
{
Sum[o]+=c*(r-l+1);
add[o]+=c;//懒惰标记
return;
}
pushdown(o,r-l+1);//因为要运算到下一行,所以更新下一行的数,
int mid=(l+r)>>1;
if(x<=mid)update(x,y,l,mid,o<<1,c);
if(y>mid)update(x,y,mid+1,r,o<<1|1,c);
Sum[o]=Sum[o<<1]+Sum[o<<1|1];
}
long long query(int x,int y,int l,int r,int o)
{
if(l>=x&&r<=y)
return Sum[o];
pushdown(o,r-l+1);//因为要运算到下一行,所以更新下一行的数,
int mid=(l+r)>>1;
long long sum=0;
if(x<=mid)sum=query(x,y,l,mid,o<<1);
if(y>mid)sum+=query(x,y,mid+1,r,o<<1|1);
return sum;
}
int main()
{
int n,m;
while(~scanf("%d%d",&n,&m))
{
memset(Sum,0,sizeof(Sum));
memset(add,0,sizeof(add));
build(1,n,1);
while(m--)
{
char str[5];
int l,r,c;
scanf("%s",str);
if(str[0]=='Q')
{
scanf("%d%d",&l,&r);
printf("%lld\n",query(l,r,1,n,1));
}
else
{
scanf("%d%d%d",&l,&r,&c);
update(l,r,1,n,1,c);
}
}
}
return 0;
}