A Simple Problem with Integers（线段树）

已于 2024-03-30 16:58:19 修改
阅读量858 收藏 12
点赞数 26
文章标签： 线段树
于 2024-03-30 16:57:33 首次发布
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/weixin_62063623/article/details/137176718
版权

目录

描述

输入

输出

样例输入 

样例输出 

思路

建树 

第一次错误解法（正确解法在下面，可跳过这一步）

正确解法

code 

描述

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.

输入

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.

输出

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

样例输入 

10 5
C 3 6 3
Q 2 4

样例输出 

9
15

思路

不要看这题全英文，但这题就是属于线段树模版题，基本做法是一样的

建树 

第一次错误解法（正确解法在下面，可跳过这一步）

树没有更新成功，id=10，id=11理论上是要继续更新他们的sum值，但我的错误代码没有更新

#define _CRT_SECURE_NO_WARNINGS 1
#include<iostream>
using namespace std;
const int N = 100010;
#define ll long long
ll nums[N];
struct Tree {
	int l, r;
	ll sum;
	ll tag;
}tree[N << 2];
void pushup(int u) {
	tree[u].sum = tree[u << 1].sum + tree[u << 1 | 1].sum;
}
void build(int l, int r, int u) {
	if (l == r) tree[u] = { l,r,nums[l] };//要与结构体Tree一一对应 

	else {
		tree[u] = { l,r };
		int mid = (l + r) >> 1;
		build(l, mid, u << 1);
		build(mid + 1, r, u << 1 | 1);
		pushup(u);
	}
}
ll query(int L, int R, int u) {
	int l = tree[u].l, r = tree[u].r;
	if (l >= L && r <= R)return tree[u].sum;

	int mid = (l + r) >> 1;
	ll sum = 0;
	if (L <= mid) sum += query(L, R, u << 1);
	if (R > mid) sum += query(L, R, u << 1 | 1);
	return sum;
}
void pushdown(int u, int ln, int rn) {
	if (tree[u].tag) {
		tree[u << 1].tag += tree[u].tag;
		tree[u << 1 | 1].tag += tree[u].tag;
		tree[u << 1].sum += tree[u].tag * ln;
		tree[u << 1 | 1].sum += tree[u].tag * rn;
		tree[u].tag = 0;
	}
}
void updatespan(int L, int R, int value, int u) {
	int l = tree[u].l, r = tree[u].r;
	int mid = (l + r) >> 1;
	if (l >= L && r <= R) {
		tree[u].tag += value;
		tree[u].sum += value * (r - l + 1);
		
		return;
	}
	pushdown(u, mid - l + 1, r - mid);
	if (L <= mid) updatespan(L, R, value, u << 1);
	if (R > mid) updatespan(L, R, value, u << 1 | 1);
	pushup(u);
}
int main()
{
	int n, q;
	while (scanf("%d%d", &n, &q) != EOF) {
		for (int i = 1; i <= n; i++) scanf("%lld", &nums[i]);
		build(1, n, 1);
		while (q--) {
			string cz;
			int op1, op2;
			cin >> cz;
		
			if (cz == "C") {
				int val;
				scanf("%d%d%d", &op1, &op2, &val);
				updatespan(op1, op2, val, 1);
			}
			else {
				scanf("%d%d", &op1, &op2);
				printf("%lld\n", query(op1, op2, 1));
			}
		}
	}
	return 0;
}

正确解法

关键在于updatespan函数中，if语句中我没有继续pushdown导致错误

  

code 

#define _CRT_SECURE_NO_WARNINGS 1
#include<iostream>
using namespace std;
const int N = 100010;
#define ll long long
ll nums[N];
struct Tree {
	int l, r;
	ll sum;
	ll tag;
}tree[N << 2];
void pushup(int u) {
	tree[u].sum = tree[u << 1].sum + tree[u << 1 | 1].sum;
}
void build(int l, int r, int u) {
	if (l == r) {
		tree[u] = { l,r,nums[l] };//要与结构体Tree一一对应 

	else {
		tree[u] = { l,r };
		int mid = (l + r) >> 1;
		build(l, mid, u << 1);
		build(mid + 1, r, u << 1 | 1);
		pushup(u);
	}
}
ll query(int L, int R, int u) {
	int l = tree[u].l, r = tree[u].r;
	if (l >= L && r <= R)return tree[u].sum;

	int mid = (l + r) >> 1;
	ll sum = 0;
	if (L <= mid) sum += query(L, R, u << 1);
	if (R > mid) sum += query(L, R, u << 1 | 1);
	return sum;
}
void pushdown(int u, int ln, int rn) {
	if (tree[u].tag) {
		tree[u << 1].tag += tree[u].tag;
		tree[u << 1 | 1].tag += tree[u].tag;
		tree[u << 1].sum += tree[u].tag * ln;
		tree[u << 1 | 1].sum += tree[u].tag * rn;
		tree[u].tag = 0;
	}
}
void updatespan(int L, int R, int value, int u) {
	int l = tree[u].l, r = tree[u].r;
	int mid = (l + r) >> 1;
	if (l >= L && r <= R) {
		tree[u].tag += value;
		tree[u].sum += value * (r - l + 1);
		pushdown(u, mid - l + 1, r - mid);//关键
		return;
	}
	pushdown(u, mid - l + 1, r - mid);
	if (L <= mid) updatespan(L, R, value, u << 1);
	if (R > mid) updatespan(L, R, value, u << 1 | 1);
	pushup(u);
}
int main()
{
	int n, q;
	while (scanf("%d%d", &n, &q) != EOF) {
		for (int i = 1; i <= n; i++) scanf("%lld", &nums[i]);
		build(1, n, 1);
		while (q--) {
			string cz;
			int op1, op2;
			cin >> cz;
		
			if (cz == "C") {
				int val;
				scanf("%d%d%d", &op1, &op2, &val);
				updatespan(op1, op2, val, 1);
			}
			else {
				scanf("%d%d", &op1, &op2);
				printf("%lld\n", query(op1, op2, 1));
			}
		}
	}
	return 0;
}

蒙奇·D·ffy
关注
  • 26
    点赞
  • 踩
  • 12
    收藏
    觉得还不错? 一键收藏
  • 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....
Integers
03-17
同伦类型理论中的等价整数这是伴随[1]进行形式化的存储库。该存储库的内容GrpdHITs/ ：[2]随附的存储库。 Categories/ ：最初尝试直接为ℤh和ℤb创建预Categories/代数。 Prebicategories/ ：与谓词，伪函数和伪变换...
A Simple Problem with Integers 线段树
Bug___Maker的博客
08-02 170
郭炜老师的代码  写了下注释 线段树的经典题目 #include&lt;bits/stdc++.h&gt; using namespace std; struct CNode { int L,R; CNode * pLeft, * pRight; long long nSum;//和 long long Inc;//区间累加量 }; CNode Tree[20...
POJ3468 A Simple Problem with Integers 线段树
_ostreamBaba
09-15 218
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...
A Simple Problem with Integers（线段树区间修改和区间求和）
star_yongheng的博客
01-24 351
A Simple Problem with Integers 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 i
A Simple Problem with Integers【线段树】
qq_50554695的博客
10-11 70
题解 线段树的模板题，注意好好理解一下lazytag：假如对 [1,5] 区间 +1，那可以在线段树[1,4]这个位置打一个标记，不继续递归往下更新，直到需要修改或查询它的儿子结点 #include<iostream> #include<sstream> #include<string> #include<queue> #include<map> #include<set> #include<vector> #include
POJ - 3468 A Simple Problem with Integers 线段树
祈的博客
05-22 129
A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 131119 Accepted: 40685Case Time Limit: 2000MSDescriptionYou have N integers, A1, A2, ... , AN. You need to deal...
牛客 17383 A Simple Problem with Integers 线段树+循环节
weixin_43824564的博客
04-10 142
这题也算是线段树比较新奇的玩法了 题意：给一个序列A 1操作是令区间a，b内 Ai = (Ai*Ai)%2018 2操作是求区间a,b内Ai的和（不需要余2018） 我们发现线段树很难去进行第一个操作 在我们已知的范围内 无法高效的进行区间内每个值平方再取余的操作 一个很难（我反正想不到）想到的操作是 寻找 循环节 我们先观察一下 写出如下代码 for(int i ...
A Simple Problem with Integers 线段树区间查询+区间修改
热爱编程，热爱技术
12-06 335
A Simple Problem with Integers Time Limit: 5000MS   Memory Limit: 131072K Total Submissions: 100883   Accepted: 31450 Case Time Limit: 2000MS Description You have N 
POJ 3468 A Simple Problem with Integers 线段树区间更新
猫ER
07-25 229
题意：有一系列的数字，然后对某个区间进行更新，C a b c，表示将区间[a, b]中的所有数字加上c，Q a b，表示查询区间[a, b]之间所有数字的和。 想法：由于这系列数字是10w个，操作10w次，所有说暴力是显然不优秀的，所以很容易想到用线段树去维护这10w个数据，然后采用区间更新的方式来进行操作，区间更新的关键就是弄清楚lazy的含义：对线段树上该节点所代表的范围的内的所有的点进行一...
poj3468 A Simple Problem with Integers 线段树区间更新，区间求和
woshinannan的专栏
07-09 464
传送门：poj3468 A Simple Problem with Integers题目大意输入：第一行输入两个数N和Q。N代表有多少个元素，Q代表进行多少次操作 第二行数输入n个数 表示对应的初始值 然后下面的Q行代表操作： C a b c把a到b区间的数增加c Q a b输出a到b区间的数量之和 输出：每当有Q操作输出a到b区间的数量之和解题思路如果总是WA的话，可以测试这个数据：10
Python解析json时提示“string indices must be integers”问题解决方法
09-18
主要介绍了Python解析json时提示“string indices must be integers”问题解决方法,结合实例形式分析了Python解析json字符串操作规范与相关使用技巧,需要的朋友可以参考下
UTM Integers Polynomials and Rings A Course in Algebra
03-05
This book will help a lot if you are studying discrete mathematics in college. The main content has been clearly illustrated in its title.
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 ...
###对华为OD分布式操作系统的详细介绍
05-22
华为OD
2110220116吴骏博.py
最新发布
05-22
2110220116吴骏博.py
基于Java的ApplicationPower快速项目生成脚手架设计源码
05-22
ApplicationPower项目生成脚手架设计源码：该项目基于Java开发，包含284个文件，主要使用Java和Shell语言。ApplicationPower是一个快速的项目生成脚手架，旨在帮助开发者快速搭建项目框架，包括创建项目结构、配置文件、开发环境等，提高开发效率。
基于MATLAB实现的OFDM经典同步算法之一Park算法仿真，附带Park算法经典文献+代码文档+使用说明文档.rar
05-22
CSDN IT狂飙上传的代码均可运行，功能ok的情况下才上传的，直接替换数据即可使用，小白也能轻松上手 【资源说明】 基于MATLAB实现的OFDM经典同步算法之一Park算法仿真，附带Park算法经典文献+代码文档+使用说明文档.rar 1、代码压缩包内容 主函数：main.m； 调用函数：其他m文件；无需运行 运行结果效果图； 2、代码运行版本 Matlab 2020b；若运行有误，根据提示GPT修改；若不会，私信博主（问题描述要详细）； 3、运行操作步骤 步骤一：将所有文件放到Matlab的当前文件夹中； 步骤二：双击打开main.m文件； 步骤三：点击运行，等程序运行完得到结果； 4、仿真咨询 如需其他服务，可后台私信博主； 4.1 期刊或参考文献复现 4.2 Matlab程序定制 4.3 科研合作 功率谱估计： 故障诊断分析： 雷达通信：雷达LFM、MIMO、成像、定位、干扰、检测、信号分析、脉冲压缩 滤波估计：SOC估计 目标定位：WSN定位、滤波跟踪、目标定位 生物电信号：肌电信号EMG、脑电信号EEG、心电信号ECG 通信系统：DOA估计、编码译码、变分模态分解、管道泄漏、滤波器、数字信号处理+传输+分析+去噪、数字信号调制、误码率、信号估计、DTMF、信号检测识别融合、LEACH协议、信号检测、水声通信 5、欢迎下载，沟通交流，互相学习，共同进步！
write a C++ program for constructing a heap (max heap) with integers and printing it in the rotated form.
06-02
Here is a C++ program that constructs a max heap with integers and prints it in the rotated form: ```cpp #include <iostream> #include <vector> using namespace std; // function to swap two integers void swap(int& a, int& b) { int temp = a; a = b; b = temp; } // function to heapify the given vector void heapify(vector<int>& arr, int n, int i) { int largest = i; // initialize largest as root int left = 2*i + 1; // left child index int right = 2*i + 2; // right child index // if left child is larger than root if (left < n && arr[left] > arr[largest]) largest = left; // if right child is larger than largest so far if (right < n && arr[right] > arr[largest]) largest = right; // if largest is not root if (largest != i) { // swap the root with largest element swap(arr[i], arr[largest]); // recursively heapify the affected sub-tree heapify(arr, n, largest); } } // function to build max heap void buildMaxHeap(vector<int>& arr, int n) { // start from the last non-leaf node and heapify each node for (int i = n / 2 - 1; i >= 0; i--) heapify(arr, n, i); } // function to print the heap in the rotated form void printRotatedHeap(vector<int>& arr, int n) { int height = log2(n) + 1; // height of the heap int index = 0; // current index in the heap int spaces = pow(2, height - 1) - 1; // number of spaces before the first element of the current level // print each level of the heap in the rotated form for (int i = 0; i < height; i++) { // print the spaces before the first element of the current level for (int j = 0; j < spaces; j++) cout << " "; // print the elements of the current level for (int j = 0; j < pow(2, i) && index < n; j++) { cout << arr[index++] << " "; // print the spaces between elements of the current level for (int k = 0; k < 2 * spaces + 1; k++) cout << " "; } // move to the next line and adjust the number of spaces for the next level cout << endl; spaces /= 2; } } int main() { int n; cout << "Enter the number of elements: "; cin >> n; vector<int> arr(n); cout << "Enter the elements: "; for (int i = 0; i < n; i++) cin >> arr[i]; // build max heap buildMaxHeap(arr, n); // print the heap in the rotated form cout << "Max heap in the rotated form:\n"; printRotatedHeap(arr, n); return 0; } ``` In this program, we first define a `swap` function to swap two integers, and a `heapify` function to heapify the sub-tree rooted at a given index `i` in the given vector `arr`. We then define a `buildMaxHeap` function to build the max heap from the given vector `arr`. Finally, we define a `printRotatedHeap` function to print the max heap in the rotated form. In the `main` function, we first read the number of elements and the elements themselves from the user using `cin`. We then build the max heap using `buildMaxHeap` function, and print the heap in the rotated form using `printRotatedHeap` function. The `printRotatedHeap` function uses the height of the heap to determine the number of levels, and the number of spaces before the first element of each level. It then prints each level of the heap in the rotated form, by printing the elements of the level followed by the spaces between elements.

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

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

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明：

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

余额充值