POJ 3468 A Simple Problem with Integers

Time Limit: 5000MS Memory Limit: 131072K
Total Submissions: 150835 Accepted: 46782
Case Time Limit: 2000MS

Description

You have N integers, A1A2, … , 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 A1A2, … , AN. -1000000000 ≤ Ai ≤ 1000000000.
Each of the next Q lines represents an operation.
“C a b c” means adding c to each of AaAa+1, … , Ab. -10000 ≤ c ≤ 10000.
“Q a b” means querying the sum of AaAa+1, … , Ab.

Output

You need to answer all Q commands in order. One answer in a line.

Sample Input

Sample Output

Hint

The sums may exceed the range of 32-bit integers.

Source

线段树模板题,注意开long long

 

stdKonjac

stdKonjac

一只挣扎的蒟蒻ACMer

评论太激烈有些评论需要亲动动手指翻页

留下你的评论

*评论支持代码高亮<pre class="prettyprint linenums">代码</pre>

*