| layout |
|---|
default |
Note: This page will be regularly updated
Lecture 1 will be held on 22 January, 2018 (Monday) from 8:00 pm to 10:00 pm at TBD.
Prerequisites: DFS Order
Target: Three variations of Mo's (Vanilla, with Updates and Trees)
Problems: DQUERY | SPOJ, 86D | CF, COT2 | SPOJ, 58 | UOJ, Tree and Coprime Queries | HE
Resources: Vanilla Mos, Mos on Trees, Mos with Updates
Target: DSU on Trees and Square Root Decomposition
Problems:
Self Study: Line Sweep
Target: HLD, Merge Sort Tree
Target: Implicit Segment Tree, Persistent Segment Tree
Target: Centroid Decomposition and Bitset
Target: Divide and Conquer
Prerequisites: You should know Segment Trees at the very least. In case you don't, you can try and go through this link. If that doesn't suffice, you can refer to this Quora Wiki.
Additionally, go through the following headings in this post:
- Partial Sum on Trees
- Starting Time, finishing time
Problems: You can try and solve the following:
-
Easy Segment Tree: RPLN | SPOJ, CSUMQ | SPOJ, 1112 | LightOJ, KGSS | SPOJ
-
Medium Segment Tree: HORRIBLE | SPOJ, GSS1 | SPOJ, 1083 | Histogram,
-
Medium-Hard Segment Tree: ORDERSET | SPOJ, 1188 | LightOJ