Course 3
Move beyond the basics and learn how to solve more technical and structured problems. This course includes 2D dynamic programming, DSU, MST, combinatorics, geometry, heaps, arbitrary-precision arithmetic, and useful optimization techniques.
8 modullar
·18 darslar
Qism 1
Modul 1: 2D DP
LCS/LIS, Knapsack (sumka)
- Eng uzun umumiy quyi-ketma-ketlik (LCS)
Eng uzun umumiy qismketma-ketlik (LCS)
- Eng uzun o‘suvchi qism ketma-ketlik
Eng uzun o‘suvchi qism-ketma-ketlik
- $O(N \log N)$ uchun eng uzun o‘suvchi qism ketma-ketlik (LIS)
Eng uzun o'suvchi qism ketma-ketlik (LIS) $O(N \log N)$ vaqt ichida