For some reason, everyone refers to it with a different name which creates a lot of confusion. This debate comes up any time someone mentions any of the names, so let's have a poll to settle this thing once and for all.
Consider the following problem.
Problem. There is an array $$$A$$$ of length $$$10^{18}$$$, initially filled with zeros. You are given $$$q$$$ queries of the following form:
- Given $$$l$$$ and $$$r$$$, find $$$A[l] + A[l + 1] + \cdots + A[r]$$$.
- Given $$$i$$$ and $$$x$$$, set $$$A[i] \gets x$$$.
What do you call the data structure that solves the problem above in time $$$O(q \log C)$$$?
Details if you're not sure what I mean