simple non-greedy segmenter
it's everything or nothing
Given an array of numbers and a sliding window size, how to get the maximal numbers in all sliding windows?
small comment
foldl
do not construct a list on each iteration
find-first-set for standard BitArray structure