Алгоритмы и структуры данных 14. Декомпозиция

簡介：

At 0:00 the lecture begins with an introduction. At 1:22 the instructor discusses the Farah‑Koltun and Bender algorithm. At 14:04 the RMQ with O(n) preprocessing and O(1) query is explained. At 28:12 the centroid decomposition is covered. At 34:10 a problem is presented: finding the number of pairs of vertices at distance d in a tree. At 55:10 heavy‑light decomposition is introduced. At 1:08:48 a theorem is stated: the path between u and v intersects no more than O(log N) heavy paths. At 1:12:27 the query answer is given. The lecture was delivered on 04.05.23 by lecturer И.Д. Степанов, with editing by Иван Калинин and filming by Михаил Сибиряков.