template<class NodeTypeT, class FinalType>
Not really a segment tree for storing segments as referred in academic literature. Can be considered a full, almost perfect, augmented binary tree. In the context of competitive programming often called segment tree.
Child classes are expected to implement updateFromChildren(NodeType&parent, NodeType& left, NodeType& right) method which calculates inner node values from children nodes.
- Template Parameters:
NodeTypeT – type of each tree element
FinalType – final child class used for curiously recurring template pattern
Subclassed by LazySegmentTreeBase< std::pair< IntegerType, IntegerType >, std::pair< IntegerType, IntegerType >, MinMaxAccumulateTree< IntegerType > >, LazySegmentTreeBase< int, uint8_t, RangeAssignMaxTree >, PointSetSegmentTree< int, PointSetMinTree >
inline explicit SegmentTreeBase(size_t size)¶
Create tree with size leaves.
size – number of leaves in the tree