Min query-1 problem

#1

sir i am not getting how the input work as in every query there is three integer first two are for query left and right and third for updation but i am not getting on which index i have to updated or by which value i have to update

#2

hello @sahudilip138
image

for first type of query , u will given L and R (i,e starting and ending index of the subarray 1 based indexing)
and u have to find min value in that subarray

for query of second type
u will be given x (it is index of array at which u have to update) ,y (it is the updated value )
and
u have to update A[x] =Y.

modify ur segment tree accordingly.

note : indexing here is 1 based.

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.