Algoteka
View all languages for this problem (1 verified and 0 unverified)

Persistent Segment Tree - Samples for C++

Problem by oml1111

Problem description:

Implement a Persistent Segment Tree for tracking range sums. Perform an assignment operation 3 times, and then output the sum of some range before the last assignment operation (after it has been performed).

Verified samples:

# Tech tags Title Creator Created date
1 0
oml1111
2022-08-12 03:50

Unverified samples:

# Tech tags Title Creator Created date
No unverified samples ...
View problem discussion (0 comments)