This script implements data structures for solving the following two problems:

  • Range minimization: given an array X of data, quickly find min(X[i:j]s:

    • Range minimization: given an array X of data, quickly find min(X[i:j]) for different ranges i:j.
    • Least common ancestors: given a tree, quickly find the lowest tree node that is an ancestor of all of a given set of nodes.


    Download from: Homepage




    Author:
    admin
    Time:
    Saturday, June 7th, 2008 at 2:29 am
    Category:
    Sound
    Comments:
    You can leave a response, or trackback from your own site.
    RSS:
    You can follow any responses to this entry through the RSS 2.0 feed.
    Navigation:

Leave a Reply