9.00 – 9.30 – Intro and IOI statistics
9.30 – 12.00 – Mathematics
12.00 – 14.30 – Segment trees 1 (Introduction, Binary search), pdf
Break
15.00 – 17.00 – Complete Search
17.00 – 19.00 – String algorithms and Tries
9.30 – 12.00 - Dynamic Programming
12.00 – 14.30 – Segment trees 2 (Lazy propagation, Solving tasks), pdf
Break
15.00 – 17.00 - Advanced Search Techniques
17.00 – 19.00 – Programming strategies