Simon Lindholm
Simon Lindholm
Is this something we want? https://github.com/Laakeri/contestlib/blob/master/src/graph/circulation.cpp
Think "2D mountain range". Johan said he wanted to have this.
- ~~should take a functor, not a function pointer~~ (done in #74) - should only return once `b - a` is smaller than 1/k times the original interval size
E.g. https://github.com/mochow13/competitive-programming-library/blob/master/DP/Convex%20Hull%20Line%20Container.cpp We might at the same time want to fix the quirk where there is a bad Line with p = -inf at the start, to make it more...
Division, modulo and multipoint evaluation seems to be pretty standard nowadays. See e.g. https://github.com/ecnerwala/icpc-book/blob/master/content/numerical/fft.cpp
https://en.wikipedia.org/wiki/Revised_simplex_method ? Seems kindof complicated... Annoying details according to wikipedia include a presolve step for getting rid of redundant constraints (which can take O(mn^2) time!) and needing periodic refactorizations. https://github.com/pakwah/Revised-Simplex-Method/blob/master/RevisedSimplex/main.cpp...
- vieta jumping - polya enumeration theorem - master theorem - sum of x^k for general k? (could derive from `\sum_{k=0}^n\binom{k}{m}=\binom{n+1}{m+1}`, possibly) - inequalities? - combinatorial sums? E.g., `sum_{k=0}^n\binom{k}{m}=\binom{n+1}{m+1}`
Eertree?
Could replace Manacher, maybe? (especially since hashing also exists) https://medium.com/@alessiopiergiacomi/eertree-or-palindromic-tree-82453e75025b https://github.com/ngthanhtrung23/ACM_Notebook_new/blob/master/String/eertree.cpp
I de-bloated the Combinatorial chapter a bit by removing some of the more pointless number sequences (could probably remove even more). But maybe a large collection of sequences for pattern...
Would have been nice during gcj (Dice Straight) not to have to reinvent incremental matching from scratch (where nodes can be added/removed from the LHS). And incremental maxflow comes up...