cses

My solution for the coding challenges of cses.fi
git clone https://git.tronto.net/cses
Download | Log | Files | Refs | README

notes.txt (245B)

      1 - Sparse tables: similar to range trees, but allows for O(1) queries for min.
      2   t[i][j] = f([j, j+2^i))
      3   https://cp-algorithms.com/data_structures/sparse-table.html
      4 
      5 - Decent implementation of Map APIs in 04_graph_algorithms/labyrinth_1193.cpp