How to solve min query-1 using D&C

#1

please help in this regard.

#2

In MIN QUERY-I, you need not only find minimum in the given range but also do updates. So to solve it, you’ll need a segment tree that can query and update in O(logN) time with an overall time complexity O(Q*logN).