Segment Tree | Set 1 (Sum of given range) - GeeksforGeeks We have an array arr[0 . . . n-1]. We should...

Please Visit: http://ift.tt/1ajReyV

Segment Tree | Set 1 (Sum of given range) - GeeksforGeeks

We have an array arr[0 . . . n-1]. We should be able to

1 Find the sum of elements from index l to r where 0 <= l <= r <= n-1

2 Change value of a specified element of the array arr[i] = x where 0 <= i <= n-1.

http://ift.tt/1iSlJRL

http://ift.tt/1pu4JJc

Segment Tree | Set 1 (Sum of given range) - GeeksforGeeks

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1tYlcF0

via LifeLong Community