HORRIBLE - Horrible Queries
World is getting more evil and it's getting tougher to get into the Evil League of Evil. Since the legendary Bad Horse has retired, now you have to correctly answer the evil questions of Dr. Horrible, who has a PhD in horribleness (but not in Computer Science). You are given an array of N elements, which are initially all 0. After that you will be given C commands. They are -
* 0 p q v - you have to add v to all numbers in the range of p to q (inclusive), where p and q are two indexes of the array.
* 1 p q - output a line containing a single integer which is the sum of all the array elements between p and q (inclusive)
In the first line you'll be given T, number of test cases.
Each test case will start with N (N <= 100 000) and C (C <= 100 000). After that you'll be given C commands in the format as mentioned above. 1 <= p, q <= N and 1 <= v <= 10^7.
Print the answers of the queries.
0 2 4 26
0 4 8 80
0 4 5 20
1 8 8
0 5 7 14
1 4 8
Super recommended to learn segment tree. I would urge problem solvers to also solve this question for maximum over a range. The whole concept of segment tree and lazy propagation will become clear.
At last AC!
Can someone provide me some critical testcases?
BIT-range update + range query
Solved in few attempts using lazy.
overflow caused me three WA, take care.Have fun!
MAX = 1e+5 -- 4 WAs
Those who have done this with Segment tree, study about Binary Indexed Tree(bit)
AC in 2nd Go!