MCPcopy Create free account
hub / github.com/VastoLorde95/Competitive-Programming / init

Function init

SPOJ/Random/DQUERY/d.cpp:41–53  ·  view source on GitHub ↗

l and r represent the range node i is responsible for. A single call init(1, 0, n-1) builds the segment tree in O(N) time

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers

nothing calls this directly

Calls 2

assignLeafMethod · 0.45
mergeMethod · 0.45

Tested by

no test coverage detected