0

I have solved a typical segment-tree problem, which lets you update one single value to another in the array, or to get, from i to j, the sum of each element multiplicated by an integer B to the power of j-i-k, being i <= k <= j the index of the new element, k=0 i and k=j-i being j, all of that m...