线段树POJ3468(成段更新,区间求和)
来源:互联网 发布:质谱软件 编辑:程序博客网 时间:2024/05/02 04:19
http://poj.org/problem?id=3468
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 51 2 3 4 5 6 7 8 9 10Q 4 4Q 1 10Q 2 4C 3 6 3Q 2 4
Sample Output
455915
Hint
Source
- 线段树POJ3468(成段更新,区间求和)
- 线段树POJ3468(成段更新,区间求和)
- POJ3468 A Simple Problem with Integers 线段树 区间成段更新+区间求和
- poj3468 线段树区间更新,区间求和
- 线段树,成段更新,区间求和
- poj3468(线段树区间求和)
- poj3468 线段树区间求和
- 线段树---poj3468 A Simple Problem with Integers:成段增减:区间求和
- 线段树(成段更新,区间求和lazy操作 )
- POJ3468-A Simple Problem with Integers(线段树 成段更新求和)
- 线段树区间更新poj3468
- poj3468线段树区间更新
- POJ3468线段树区间更新
- POJ3468 线段树 区间更新
- poj3468 A Simple Problem with Integers 线段树延迟标记区间更新区间求和
- poj3468 A Simple Problem with Integers 线段树区间更新,区间求和
- 线段树(成段更新 关于延迟标记) poj3468
- POJ3468 区间加,区间求和 线段树模板
- Zookeeper(一)简介
- 退出整个应用程序 以及 利用intent标志跳转到某个Activity
- C#学习笔记(一)
- java内省
- 第二篇
- 线段树POJ3468(成段更新,区间求和)
- C语言实现的数独解题程序
- bzoj 1131: [POI2008]Sta
- HTTP报文
- 使用storyBoard的优缺点
- JQuery性能优化
- 机器学习十大算法的每个算法的核心思想、工作原理、适用情况及优缺点
- Objective-c自学笔记(5)-自动释放池
- GUI+定时器