[Jprogramming] A practical problem: minimum distance with penalties

[Brian Schott]

Does your really fast algorithm start with something like my mask, but
instead of a while. loop on the whole array, do you just check to update
the indices one above each altered atom of the revised D?

On Wed, Feb 24, 2016 at 11:43 AM, Henry Rich <henryhrich at gmail.com> wrote:

> That looks like the right result.
>
> Henry Rich
>
>

-- 
(B=)