【树状数组】【模板3】区间修改，区间查询

晚霞是你的晚安

于 2019-06-26 20:56:12 发布

阅读量1.8k

点赞数

分类专栏：数据结构

本文链接：https://blog.youkuaiyun.com/qq_43398760/article/details/93776758

版权

本文介绍如何利用树状数组处理区间修改和区间查询的问题，通过差分数组和数学推导，详细解释了如何存储和计算区间值，以解决大规模数据的高效求解问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Description

You have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type of op
eration 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.
1．给[a ，b]整体上加上一个常数c。
2．查询[a ，b]区间的和。

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. The sums may exceed the range of 32-bit integers

Sample Input