poj 3468 向上和向下传递

最新推荐文章于 2020-07-26 22:38:19 发布
最新推荐文章于 2020-07-26 22:38:19 发布
阅读量1.5k 收藏
点赞数
分类专栏： Data Struct、Algorithm and ACM 文章标签： query numbers build each output c
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/cscj2010/article/details/7331174
版权

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 ≤ 10

了解本专栏 订阅专栏 解锁全文 超级会员免费看
狮子和猿
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
订阅专栏
北京大学OpenJudge 3243 A Simple Problem with Integers （线段树区间求和）
qq_37618760的博客
08-24 181
描述 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 ...
A Simple Problem with Integers
qq_46126537的博客
01-21 178
原题传送门 代码 #include <bits/stdc++.h> using namespace std; typedef long long ll; const int N = 1e5 + 10; int n, q,t; ll a[N],sum[N], add[N]; int l[N], r[N],pos[N]; void divide() { t = sqrt((double)n); for (int i = 1; i <= t; i++) {
寒假集训_专题四题解_B - A Simple Problem with Integers
m0_46185124的博客
03-12 116
题目 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...
A Simple Problem with Integers POJ - 3468（线段树）
Steve·Curcy
04-09 130
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 s...
A Simple Problem with Integers-线段树模板(入门)
Godblessuam的博客
05-13 1484
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 su...
POJ3468.zip_poj3468
09-14
从l和r分别开始，向下合并每个2的幂次节点的值，最后得到的和就是区间[l, r]的累加和。 在解决POJ3468这个题目时，参赛者可能需要理解并熟练运用树状数组来处理区间操作。例如，题目可能给出一个数组和一系列的指令...
POJ3468.zip_ACM
09-23
"POJ3468"是这个特定问题的编号，在编程竞赛平台上的每个题目都有一个唯一的编号，便于识别和讨论。 描述中提到的“线段树处理”是指一种数据结构和算法技术，用于高效地处理区间查询和修改操作。线段树是一种平衡...
POJ1852题目和详细解答
02-05
POJ1852题目是一道关于计算最早和最晚可能时间的题目，问题描述如下：有一根长度为L厘米的水平竿，每个蚂蚁以1厘米/秒的速度移动。当蚂蚁走到竿子的一端时，它会立刻掉下去。当两个蚂蚁相遇时，它们会掉头并开始朝...
POJ.rar_poj java_poj1048
最新发布
09-24
【标签】"poj_java poj1048" 明确了这是POJ平台上的Java语言题目，编号为1048，所以解题方案会用到Java编程语言，同时可能涉及到数据结构和算法的设计。 【压缩包子文件的文件名称列表】"POJ" 暗示这个压缩包可能...
POJ_3131.zip_POJ 八数码_poj
09-20
标题中的“POJ_3131.zip_POJ 八数码_poj”指的是一个与编程竞赛网站POJ（Problem Set Algorithm）相关的项目，具体是针对3131号问题的解决方案，该问题涉及到了八数码游戏。八数码游戏，又称滑动拼图，是一个经典的...
C - A Simple Problem with Integers
默的博客
02-12 147
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 as...
POJ 3468 A Simple Problem with Integers 线段树区间更新 （lazy策略 值在基础上相加或相减）
深海沧澜的博客
02-08 206
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 ...
POJ3468(A Simple Problem with Integers)
weixin_43808717的博客
07-26 111
A Simple Problem with Integers 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
A Simple Problem with Integers POJ - 3468（树状数组）
Coldfresh的博客
04-06 263
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 su...
ccnu-线段树-简单的区间更新（三题）
diejixiang8988的博客
12-08 205
题目一：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...
Simple Problem with Integers（线段树。区间加）
晚安(￣o￣) . z Z
11-24 126
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 su...
【POJ】3468 - A Simple Problem with Integers（线段树区间更新）
wyg1997
12-06 1926
题目链接：点击打开链接 A Simple Problem with Integers Time Limit: 5000MS   Memory Limit: 131072K Total Submissions: 100877   Accepted: 31450 Case Time Limit: 2000MS Descrip
线段树模版—A Simple Problem with Integers
llzhh的博客
04-29 1579
D - A Simple Problem with Integers Time Limit:5000MS     Memory Limit:131072KB     64bit IO Format:%I64d & %I64u Description 给出了一个序列，你需要处理如下两种询问。 "C a b c"表示给[a, b]区间中的值全部增加c (-10000 ≤ c
hdu 4267 A Simple Problem with Integers(树形结构-线段树)
不戚的专栏
08-29 1106
hdu 4267 A Simple Problem with Integers(树形结构-线段树)
POJ编程题解资源集合
5. **整数的立方和(POJ2679)**：这类题目可能需要计算序列的累加和，对数值进行立方运算。 6. **计算表达式的值(POJ2696)**：涉及到解析和计算数学表达式，可能需要用到栈来处理运算符优先级。 7. **逆波兰表达式...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值