Time Limit: 5000MS | Memory Limit: 131072K | |
Total Submissions: 29597 | Accepted: 8312 | |
Case Time Limit: 2000MS |
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
Source
#include<cstdio>
#include<iostream>
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
using namespace std;
const int mm=111111;
long long dly[mm<<2],sum[mm<<2];
void pushup(int rt)
{
sum[rt]=sum[rt<<1]+sum[rt<<1|1];
}
void pushdown(int rt,int l1,int l2)
{
dly[rt<<1]+=dly[rt];
dly[rt<<1|1]+=dly[rt];
sum[rt<<1]+=dly[rt]*l1;
sum[rt<<1|1]+=dly[rt]*l2;
dly[rt]=0;
}
void build(int l,int r,int rt)
{
dly[rt]=0;
if(l==r)
{
scanf("%lld",&sum[rt]);
return;
}
int m=(l+r)>>1;
build(lson);
build(rson);
pushup(rt);
}
void updata(int L,int R,long long val,int l,int r,int rt)
{
if(L<=l&&R>=r)
{
dly[rt]+=val;
sum[rt]+=val*(r-l+1);
return;
}
int m=(l+r)>>1;
if(dly[rt])pushdown(rt,m-l+1,r-m);
if(L<=m)updata(L,R,val,lson);
if(R>m)updata(L,R,val,rson);
pushup(rt);
}
long long query(int L,int R,int l,int r,int rt)
{
if(L<=l&&R>=r)return sum[rt];
int m=(l+r)>>1;
if(dly[rt])pushdown(rt,m-l+1,r-m);
long long ret=0;
if(L<=m)ret+=query(L,R,lson);
if(R>m)ret+=query(L,R,rson);
pushup(rt);
return ret;
}
int main()
{
int i,j,k,n,m;
char op[55];
while(~scanf("%d%d",&n,&m))
{
build(1,n,1);
while(m--)
{
scanf("%s",op);
if(op[0]=='C')
{
scanf("%d%d%d",&i,&j,&k);
updata(i,j,k,1,n,1);
}
else
{
scanf("%d%d",&i,&j);
printf("%lld\n",query(i,j,1,n,1));
}
}
}
return 0;
}