Interval maintenance (tree array)
Problem Description:
Title Description
Problem solving ideas:
The basic knowledge of tree array will not be repeated here. We only need to know that it can deal with interval maintainability and modifiable RMQ problems, which is more efficient.
The following is the operation of segment tree
Single point modification
void update(int x,in ...
Posted by franknu on Sat, 29 Jan 2022 15:26:36 +0100
P4428-[BJOI2018] binary [tree array, set]
Topic
Title Link: https://www.luogu.com.cn/problem/P4428
General idea of the topic
Count Reg
n
n
n
0
/
1
0/1
0 / 1 string requires su ...
Posted by bruceg on Wed, 19 Jan 2022 12:15:46 +0100
P1908 reverse sequence pair (discretization / dynamic open point)
Title Link: Click to enter
subject
Idea 1 (tree array + discretization)
The range given by this question is 1e9. Normally, the number is used as the subscript and the corresponding value is modified. However, if the number is used as the subscript here, it will not work, because an array as large as 1e9 cannot be opened, so we discretize ...
Posted by vozzek on Thu, 23 Dec 2021 05:29:21 +0100
CF703D Mishka and Interesting sum
General idea of the topic
given
n
n
Sequence of n numbers
a
a
a.
m
m
m operations.
There is one typ ...
Posted by bl00dshooter on Wed, 03 Nov 2021 07:09:14 +0100