A Simple Problem with Integers - 线段树

最新推荐文章于 2021-09-08 10:31:08 发布
最新推荐文章于 2021-09-08 10:31:08 发布
阅读量156 收藏
点赞数
分类专栏： 线段树
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/wechat_huihui/article/details/80431330
版权

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 s

最低0.47元/天 解锁文章
wechat_huihui
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
Printing Floating-Point Numbers Quickly and Accurately with Integers - 2010 (dtoa-pldi2010)-计算机科学
04-22
Printing Floating-Point Numbers Quickly and Accurately with IntegersFlorian Loitsch Inria Sophia Antipolis2004 Route des Lucioles - BP 93 - 06902 Sophia Antipolis Cedex florian.loitsch@inria....
Improved Division by Invariant Integers-计算机科学
04-22
Niels Möller and Torbj̈orn GranlundAbstract—This paper considers the problem of dividing a two-word integer by a single-word integer, together with a few extensions and applications. Due to lack ...
A Simple Problem with Integers（线段树）
riversu
08-02 432
简单的区间修改，区间查询，模板一枚
A Simple Problem with Integers----线段树
bless295的博客
06-02 3108
C - A Simple Problem with Integers Time Limit:5000MS     Memory Limit:131072KB     64bit IO Format:%I64d & %I64u Submit Status Practice POJ 3468 Description You have N integers, A1
A Simple Problem with Integers-线段树模板(入门)
Godblessuam的博客
05-13 1460
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...
A Simple Problem with Integers BZOJ3212 线段树
loooooog的博客
12-13 194
A Simple Problem with Integers BZOJ3212 线段树 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 nu...
A Simple Problem with Integers （线段树）
10-30 140
Description You haveNintegers,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 othe...
All-prime-numbers-in-between-two-integers-using-django
04-05
使用django的两个整数之间的所有素数 要运行此目录，请使用以下命令行：-$ python manage.py runserver primeno是主目录prime是应用程序目录 ... 我们已经将这些详细信息保存在datbase（sqlite3）中。...
leetcode伪代码-find-n-unique-integers-sum-up-to-zero:find-n-unique-integer
06-30
leetcode伪代码find-n-unique-integers-sum-up-to-zero 题目解读： 题目来源: 原文: Given an integer n, return any array containing n unique integers such that they add up to 0. 解读： 给定一个正整数n, ...
leetcode2sumc-leetcode-1304-Find-N-Unique-Integers-Sum-up-to-Zero:leetc
07-06
leetcode 2 和 c leetcode 1304 - 找到 N 个唯一整数总和为零 C＃ public int [] SumZero ( int n ) { var arr = new int [ n ]; int j = 0 ; int x = 1 ; for ( int i = 0 ; i < n / 2 ; i ...}
A Simple Problem with Integers(线段树)
geguojun 的专栏
08-12 496
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 i
A Simple Problem with Integers （线段树模板）
自渡的博客
04-10 182
You haveNintegers,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 (线段树区间更新区间求和)
galesaur_wcy
05-24 231
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（线段树）
_BOSS_的博客
02-29 633
题面 【题目描述】 你有一些整数，和一些操作与询问需要处理 【输入】 第一行：NNN,QQQ，1≤N,Q≤1000001 ≤ N,Q ≤ 1000001≤N,Q≤100000. 第二行：NNN个整数， A1,A2,...,AN.,−1000000000≤Ai≤1000000000A_1, A_2, ... , A_N.,-1000000000 ≤ A_i ≤ 1000000000A1​,A2​,....
A Simple Problem with Integers （基础线段树）
acmDragon的博客
07-30 633
题意 给出了一个序列，你需要处理如下两种询问 “C a b c”表示给[a, b]区间中的值全部增加c (-10000 ≤ c ≤ 10000)。 “Q a b” 询问[a, b]区间中所有值的和。 本题很简单注意数据范围就可以了 （他是很直白的区域更新）lazy 标记要用 long long 在这错了很多次。以下是AC代码#include <iostream> #include <s
A Simple Problem with Integers（POJ-3468）线段树 区间更新+区间求和
一只特立独行的猫的博客
09-08 100
ASimple Problem with Integers（POJ-3468）线段树 区间更新加区间求和题目大意 POJ-3468的原题链接 题目大意 有一个数组长度为N的数组，总共输入T组数据指令，当输入 Q 指令时，代表要将 下标在 a,b之间的元素求和，而当输入C指令时，要求要将下标在a,b之间的所有数组元素都加上c. #include <cstring> #include &l...
A Simple Problem with Integers - 线段树（改变区间的值）
m0_37579232的博客
04-23 164
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
llzhh的博客
04-29 1575
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 1103
hdu 4267 A Simple Problem with Integers(树形结构-线段树)
you are going to read a serial of none-negative integers, which ends with a
最新发布
09-22
你将要读取一连串的非负整数，直到遇到“a”为止。 这个问题提示我们需要连续地读取非负整数，直到输入的字符是"a"为止。首先，我们需要声明一个变量来存储输入的整数值，并初始化为0。然后，我们使用一个循环来...

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明：

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

余额充值