Description
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
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <cmath>
#include <algorithm>
#define LL long long
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define maxn 111111
using namespace std;
LL sum[maxn<<2];
LL add[maxn<<2];
void PushUp(int rt)
{
sum[rt] = sum[rt << 1] + sum[rt<<1|1];
}
void pushdown(int rt,int m)
{
if(add[rt])
{
add[rt<<1]+=add[rt];
add[rt<<1|1]+=add[rt];
sum[rt<<1]+=(m-(m>>1))*add[rt];
sum[rt<<1|1]+=(m>>1)*add[rt];
add[rt]=0;
}
}
void build(int l, int r, int rt)//建立线段树
{
add[rt]=0;
if (l == r)
{
scanf("%I64d", &sum[rt]);
return;
}
int m = (l + r) >> 1;
build(lson);
build(rson);
PushUp(rt);
}
void update(int L, int R,int c, int l, int r, int rt)
{
if(L<=l&&R>=r)
{
add[rt]+=c;
sum[rt]+=(LL)c*(r-l+1);
return ;
}
pushdown(rt,r-l+1);
int m=(r+l)>>1;
if(L<=m)
update(L,R,c,lson);
if(R>m)
update(L,R,c,rson);
PushUp(rt);
}
LL query(int L, int R, int l, int r, int rt)//查询线段树
{
if (L <= l && R>= r) return sum[rt];
pushdown(rt,r-l+1);
int m = (l + r) >> 1;
LL ret = 0;
if (L<=m) ret += query(L, R, lson);
if (R>m) ret += query(L, R, rson);
return ret;
}
int main()
{
int n,m;
char d[10];
scanf("%d%d",&n,&m);
build(1, n, 1);
for(int i=0; i<m; i++)
{
scanf("%s",d);
int x,y,z;
if (d[0] == 'Q')
{
scanf("%d%d",&x,&y);
printf("%I64d\n",query(x,y,1,n,1));
}
else
{
scanf("%d%d%d",&x,&y,&z);
update(x,y,z,1,n,1);
}
}
return 0;
}