Nu exista diferente intre titluri.
Diferente intre continut:
h2. Range Sum
bq.. Given A, an n elements array, implement a data structure for point updates and range sum queries:
- update(i, x): A[i] := x,
- query(lo, hi) returns A[lo] + A[lo+1] + .. + A[hi].
- set(i, x): A[i] := x,
- sum(lo, hi) returns A[lo] + A[lo+1] + .. + A[hi].
p. The naive solution uses an array. It takes $O(1)$ time for an update and $O(hi - lo) = O(n)$ for the range sum.
Nu exista diferente intre securitate.
Topicul de forum nu a fost schimbat.
