By popular request, this week's episode will cover segment trees. I'll cover both the theory side and implementation of this popular data structure.
You can practice segment trees on this problem: http://codeforces.com/problemset/problem/52/C
03:12 - Segment tree as a data structure of divide and conquer
06:42 - Example of using segment tree for range minimum query
14:17 - Analyzing runtime of queries
17:01 - Lazy propagation
20:20 - Example of lazy propagation
26:25 - Representing tree as an array
28:52 - Coding segment tree
51:14 - Announcements
Thank you to Mikhail Goncharov for the time links!
