summaryrefslogtreecommitdiff
path: root/log.org
diff options
context:
space:
mode:
authorAditya Naik2020-06-08 21:17:18 -0400
committerAditya Naik2020-06-08 21:17:18 -0400
commit36e8897c90442cd558cdddf3f2ae38f148ac5581 (patch)
tree9f62cfe733ffced1fa7a0916750ac24af5ac5112 /log.org
parent7f1d8a56cd3d5065e442b8e592ffe17d40d4c3d2 (diff)
Older files and necklace
Diffstat (limited to 'log.org')
-rw-r--r--log.org7
1 files changed, 7 insertions, 0 deletions
diff --git a/log.org b/log.org
index ed8bff7..7045172 100644
--- a/log.org
+++ b/log.org
@@ -15,3 +15,10 @@
- A segment tree perhaps?
- Attempting a (naive) linear array first to see if it works (half expecting it to fail on time limit)
- Failed on TLE
+* TODO 1203
+- Min priority queue with decrease-key
+* TODO 10954
+- Min priority queue, popping each element and adding it
+- Adding up costs of a simple array would not work since adition of sums would not necespasarily be smallest (adding other sums to additions could be shortest)
+* TODO 11995
+- Would need all STL DS??