I’m trying to learn Binary Indexed Tree. I’ve seen we can use point update,point query and also range update,point query. Is there anyway where we can use range update,range query. I was solving HORRIBLE-SPOJ. There we can use that concept(also Segment Tree-lazy). Can anyone help?
Thank you. 