Time Limit: 5000MS | Memory Limit: 131072K | |
Total Submissions: 84115 | Accepted: 26040 | |
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
The sums may exceed the range of 32-bit integers.
区间更新的核心在 pushdown(),作用于当前有标记的节点,标记的功能自行设置,在这个题中,标记的是区间的加数。
更新区间时,遇到到有标记的节点而且需要向下更新时,pushdown()将当前节点的加数转移到左右子节点,然后将自身归零。类似于点更新,将节点中的变量看做点,增加一个向下转移的步骤。
查询时 pushdown(),原理相同。
#include"cstdio"
#include"iostream"
#define LL long long
#define N 500005
LL num[N], sum[N], add[N], v;
int n, q, l, r, i, j;
char ord;
using namespace std;
void pushdown(int id, int l, int r)
{
if(add[id])
{
int mid = (l + r) >> 1;
add[id*2] += add[id];
add[id*2+1] += add[id];
sum[id*2] += add[id] * (mid - l + 1);
sum[id*2+1] += add[id] * (r - mid);
add[id] = 0;
}
}
void update(int id, int l, int r, int ql, int qr, int c)
{
if(l > qr || r < ql)
return;
if(l >= ql && r <= qr)
{
add[id] += c;
sum[id] += c * (r - l + 1);
return;
}
pushdown(id, l, r);
int mid = (l + r) >> 1;
update(id*2, l, mid, ql, qr, c);
update(id*2+1, mid+1, r, ql, qr, c);
sum[id] = sum[id*2] + sum[id*2+1];
}
LL query(int id, int l, int r, int ql, int qr)
{
if(l > qr || r < ql)
return 0;
if(l >= ql && r <= qr)
return sum[id];
pushdown(id, l, r);
int mid = (l + r) >> 1;
return query(id*2, l, mid, ql, qr) + query(id*2+1, mid+1, r, ql, qr);
}
int main(void)
{
scanf("%d%d", &n, &q);
for(int k=1; k <= n; k++)
{
scanf("%lld", &num[k]);
update(1, 1, n, k, k, num[k]);
}
while(q--)
{
getchar();
scanf("%c", &ord);
if(ord == 'Q')
{
scanf("%d%d", &l, &r);
printf("%lld\n", query(1, 1, n, l, r));
}
else
{
scanf("%d%d%lld", &l, &r, &v);
update(1, 1, n, l, r, v);
}
}
return 0;
}