cphb
cphb copied to clipboard
pllk
Competitive Programmer's Handbook
As far as I can tell, knowledge of something like Aho Corasick or string automaton is necessary to solve some of these problems like "Finding Patterns" , "Counting Patterns", etc....
I don't understand instructions of given problem `scheduling` at `greedy algorithms`. Can you provide some extra reference for it or explain in detail what does it mean `find a schedule...
It would be better if code could be included in this section to provide a better understanding of the problem of **counting the paths in 7x7 grid**. I am posting...
I know you write n counts the amount of numbers, but it's a funny coincidence there are four numbers each separate by 4. Simply adding a 5th number would remove...
The first graph in Bellman-Ford example in chapter 13 has a typo, node 6 should be node 5
1. Page 128. Algorithm outputs for nodes 1 -> 4 distance -5 if undirected and 1 if directed. In both cases, Dijkstra correctly finds path 1>3>4 (but with the wrong...
 Where does -5 come from?
