rohitcode26 / segTree

Repository from Github https://github.comrohitcode26/segTreeRepository from Github https://github.comrohitcode26/segTree

Acknowledgement :

I was able to complete the project only after closely studying Kartik Arora's implementation.

segTree

General purpose segment tree library.

  1. include SegmentTree.h

  2. to construct a segment tree you need to specify the following:
    a. The datatype of array for which the tree is being constructed.
    b. an array or vector for which the tree is to be constructed.
    c. a value that can be used to fill the extra nodes of the tree.
    d. a function combine that specifies how the result of left and right child of a node
    should be used to generate the value of current node.

  3. Example usage:
    int small(int x,int y){return min(x,y);}
    SegmentTree < int > rangeMinQueries(dataVector,INT_MAX,small);

    int sum(int x,int y){return x+y;}
    SegmentTree < int > rangeSumQueries(dataVector,0,sum);

    long long product(long long x,long long y){return x*y;}
    SegmentTree < long long > rangeProductQueries(dataVector,1,product);

solution to SPOJ GSS1 using segTree library : https://ideone.com/EFxf6O
solution to SPOJ KGSS using segTree library : https://ideone.com/fUK5Jz

About


Languages

Language:C++ 100.0%