Time Limit: 5000MS | Memory Limit: 131072K | |
Total Submissions: 44887 | Accepted: 13148 | |
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
#include<stdio.h>
typedef struct NODE
{
int left, right;
long long count;
long long sum;
}Node;
Node array[300000];
void buildTree(int root, int left, int right)
{
array[root].left = left;
array[root].right = right;
if(left < right)
{
buildTree(root * 2, left, (left + right) / 2);
buildTree(root * 2 + 1, (left + right) / 2 + 1, right);
}
}
void add(int root, int left, int right, long long count)
{
if(array[root].left == left && array[root].right == right)
{
array[root].count += count;
return ;
}
else
{
array[root].sum += count * (right - left + 1);
if(right < (array[root].left + array[root].right ) / 2 + 1)
add(root * 2, left, right, count);
else if(left > (array[root].left + array[root].right ) / 2)
add(root * 2 + 1, left, right, count);
else
{
add(root * 2, left, (array[root].left + array[root].right ) / 2, count);
add(root * 2 + 1, (array[root].left + array[root].right ) / 2 + 1, right, count);
}
}
}
long long getSum(int root, int left, int right)
{
if(array[root].left == left && array[root].right == right)
return array[root].sum + array[root].count * ( right - left + 1);
if(array[root].count != 0)
{
add(root * 2, array[root].left , (array[root].left + array[root].right) / 2, array[root].count );
add(root * 2 + 1, (array[root].left + array[root].right) / 2 + 1, array[root].right, array[root].count );
array[root].sum += array[root].count * (array[root].right - array[root].left + 1);
array[root].count = 0;
}
if(left > (array[root].left + array[root].right ) / 2)
return getSum(root * 2 + 1, left, right);
else if(right < (array[root].left + array[root].right ) / 2 + 1)
return getSum(root * 2, left, right);
else
return getSum(root * 2 , left, (array[root].left + array[root].right ) / 2) + getSum(root * 2 + 1, (array[root].left + array[root].right ) / 2 + 1, right);
}
void insert(int root, int i, int num)
{
array[root].sum += num;
if(array[root].left == array[root].right )
{
return ;
}
if(i > (array[root].left + array[root].right ) / 2 )
insert(root * 2 + 1, i, num);
else
insert(root * 2, i, num);
}
int main()
{
// freopen("in.txt", "r", stdin);
int n, q;
scanf("%d%d", &n, &q);
int i;
int num;
buildTree(1, 1, n);
for(i = 1; i <= n; i++)
{
scanf("%d", &num);
insert(1, i, num);
}
char ch;
int left, right, count;
for(i = 0; i < q; i++)
{
getchar();
scanf("%c", &ch);
if(ch == 'Q')
{
scanf("%d%d", &left, &right);
printf("%lld\n", getSum(1, left, right));
}
else
{
scanf("%d%d%d", &left, &right, &count);
add(1, left, right, count);
}
}
return 0;
}