##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Harder range updates
Given an array of integers and queries:
Update: add to positions
Query: return Constraints: . This is a challenge for both segment trees and sqrt decomposition. The update isn't uniform, it's a polynomial pattern. Think about what you need to store per block to handle this efficiently.
