aboutsummaryrefslogtreecommitdiff
path: root/notes.txt
diff options
context:
space:
mode:
authorSebastiano Tronto <sebastiano@tronto.net>2026-07-06 19:08:08 +0200
committerSebastiano Tronto <sebastiano@tronto.net>2026-07-06 19:08:08 +0200
commit96254947699986c59f0dc63d69fd4b76bd3ed43e (patch)
tree6c4dca945d7f7427c48be234d827fe4d33be02c5 /notes.txt
downloadcses-96254947699986c59f0dc63d69fd4b76bd3ed43e.tar.gz
cses-96254947699986c59f0dc63d69fd4b76bd3ed43e.zip
Initial commit
Diffstat (limited to '')
-rw-r--r--notes.txt5
1 files changed, 5 insertions, 0 deletions
diff --git a/notes.txt b/notes.txt
new file mode 100644
index 0000000..ca75141
--- /dev/null
+++ b/notes.txt
@@ -0,0 +1,5 @@
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

Generated with cgit - Back to sebastiano.tronto.net