Омодагӣ ба олимпиада
Preparation to IOI Part 4
Study the powerful techniques and data structures used in harder problems. This course covers trie, sparse table, segment tree, lazy propagation, tree techniques, binary jumping, divide and conquer, cyclic games, and sqrt methods.
- 10 модулҳо
- 25 дарсҳо
бо пайраҳа равед
Харитаи курс
- иҷро шуд
- аз ин ҷо сар кунед
- дар пеш
- Sparse Table for Static Range Minimum QueriesНазарияA sparse table prepares answers for selected intervals of a fixed array. Once the table is built, we can find the minimum on any interval in $O(1)$ time. The main idea is to cover the query with two stored intervals, allowing them to overlap.Ин мундариҷа дар тарҳи ҷории шумо дастрас нест
- аз ин ҷо сар кунедLowest Common Ancestor with a Sparse TableНазарияLowest Common Ancestor with a Sparse TableДарсро кушоед
- Disjoint Sparse TableНазарияDisjoint Sparse Table
- 2D Sparse Table for Rectangle Minimum QueriesНазария2D Sparse Table for Rectangle Minimum Queries
марра!