MCPcopy Create free account
hub / github.com/SuprDewd/CompetitiveProgramming / query

Function query

code/data-structures/persistent_segment_tree.cpp:27–31  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

25 segs[nid].sum = segs[id].sum + v;
26 return nid; }
27int query(int id, int l, int r) {
28 if (r < segs[id].l || segs[id].r < l) return 0;
29 if (l <= segs[id].l && segs[id].r <= r) return segs[id].sum;
30 return query(segs[id].lid, l, r)
31 + query(segs[id].rid, l, r); }
32// vim: cc=60 ts=2 sts=2 sw=2:

Callers 2

queryMethod · 0.85
rsqMethod · 0.85

Calls

no outgoing calls

Tested by

no test coverage detected