Programmer Think

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 ...

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 ...

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 ...

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 ...

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 ...