## YBTOJ: job evaluation (block)

analysis
Think first
O
(
n
m
)
O(nm)
How to do O(nm). Sweep from left to right, and keep the current value and
x
...

Posted by **TowerOfPower** on *Thu, 24 Feb 2022 05:37:27 +0100*

## Chessboard coverage (C + + | divide and conquer | recursion)

Title Description
Description
Chessboard coverage problem: given a chessboard with a size of 2^n2^n small squares, one of the positions has been filled. Now we need to cover the remaining small squares with an L-shape (remove one of the small squares from the large squares composed of 22 small squares). Find out the covering scheme, th ...

Posted by **bogeyman** on *Mon, 21 Feb 2022 14:50:08 +0100*

## [Simulation Competition] infection (point division, strong connected component reduction point)

background
One day, a group of dogs suddenly began to moisten people in the past, so the students banned this part of the science and technology building.
~
Deadcodes: old machine room
Problem surface
Your country
...

Posted by **Janjan** on *Thu, 10 Feb 2022 21:07:32 +0100*

## LUOGU P4119 Ynoi2018 Future Diary

Better reading experience
meaning of the title
There is a sequence with a length of \ (n \), with a total of \ (m \) operations:
1 l r x y, change all \ (x \) in the interval \ ([l, r] \) into \ (Y \);
2 l r k, query the smallest value of \ (k \) in the interval \ ([l, r] \)
\(1\le n, m\le 10^5 \), any time \ (1\le a_i\le 10^5 \)
Problem solu ...

Posted by **stickynote427** on *Wed, 02 Feb 2022 23:26:00 +0100*

## A preliminary study on the history of joysc 2014 Day1

Roll back Mo team
The core of Mo team algorithm is to quickly calculate new results when the interval changes. However, when our sequence (or any other set) can only easily implement one operation in addition or deletion, and the other operation is difficult to implement, it is necessary to roll back the Mo queue by using a variant of the ...

Posted by **robotta1530** on *Wed, 10 Nov 2021 08:13:32 +0100*