while lo + 1 <= r:
   lo += 1
   sum += a[lo]

==

==
 
!<{margin-right: 20px; auto;display:block;border: 1px solid gray;}blog/square-root-trick?image001.png!
 
 

The query takes less than <tex>k + n/k + k = 2k + n/k</tex> time. 2k + n/k is minimized when k ~ sqrt(n). For k = sqrt(n) the query takes O(sqrt(n)) time.
This trick also works for other associative operations, like: min, gcd, product etc.