UVA - 11297(线段树套线段树)

最新推荐文章于 2024-02-02 00:40:02 发布

Weaver丶

最新推荐文章于 2024-02-02 00:40:02 发布

阅读量282

点赞数

分类专栏：数据结构线段树

本文链接：https://blog.csdn.net/qq_44641782/article/details/104007107

版权

本文介绍了UVA 11297问题，这是一个关于人口统计的 ACM 竞赛题目。题目要求在N×N的区域网格中，对特定区域内的最大和最小人口变化进行查询和更新。解题方法使用线段树套线段树的数据结构，外层处理行，内层处理列。对于修改和查询操作，分别对应更新线段树节点和检索线段树范围。作者通过学习分块知识并解决了一些相关题目，成功地完成了这个挑战，尽管以前对树套树的理解有些模糊，但这次实现过程相对顺利。

摘要由CSDN通过智能技术生成

放个链接在这里：UVA - 11297

This year, there have been many problems with population calculations, since in some cities, there
are many emigrants, or the population growth is very high. Every year the ACM (for Association
for Counting Members) conducts a census in each region. The country is divided into N ∧ 2 regions,
consisting of an N × N grid of regions. Your task is to find the least, and the greatest population in
some set of regions. Since in a single year there is no significant change in the populations, the ACM
modifies the population counts by some number of inhabitants.
Input
In the first line you will find N (0 ≤ N ≤ 500), in following the N lines you will be given N numbers,
wich represent, the initial population of city C[i, j]. In the following line is the number Q (Q ≤ 40000),
followed by Q lines with queries:
There are two possible queries:
• ‘q x1 y1 x2 y2’ which represent the coordinates of the upper left and lower right of where you
must calculate the maximum and minimum change in population.
• ‘c x y v’ indicating a change of the population of city C[x, y] by value v.
Output
For each query, ‘q x1 y1 x2 y2’ print in a single line the greatest and least amount of current population. Separated each output by a space.
Notice: There is only a single test case.
Sample Input

Sample Output

9 0
10 0
9 2

题目大意：有一个n*n的矩阵，然后有两种操作，第一种就是查询一个小矩阵中的元素的最大值和最小值，另一种就是我们可以修改矩阵中的一个值，将它修改为val。

解题思路：线段树套线段树，外层维护行，内层维护列，然后修改时先修改内层的值，再修改外层的值，查询时就先让满足外层的条件，然后再去查询满足内层的条件的值。
树套树的题我之前只写过两三道，其实也不怎么熟悉，而且之前怎么写的也有点模糊了，今天写这道题的时候，学长讲了分块的知识点，然后又去找了两个题来做，也写出了许多bug，然后再来做这道题的时候，感觉写的过程挺顺利的(还好之前的理解还没忘)，就是一边写一边想之前是怎么写的，然后也自己写出来了，而且还没怎么调试，一发A[笑]，不过以后还是要多学一些树套树，今天看到分块的题解中有很多都写了点分治和树套树。呜呜呜，wtcl。
代码：

#pragma GCC optimize(2)
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <bitset>
#include <queue>
#include <random>
#include <time.h>
using namespace std;
#define int long long
#define ls root<<1
#define rs root<<1|1
const int maxn = 666;
const int inf = 0x3f3f3f3f;
std::mt19937 rnd(233);
struct Node
{
   
    int l, r, date1, date2;
};
struct tree{
   
    int l, r;
    Node node[maxn<<2];
} t[maxn << 2];
int n;
inline void build(int rt,Node <