Dynamic Range Minimum Queries

# cook your dish here
n,q = map(int,input().split())
x = list(map(int,input().split()))

c = [0]*(n)
c.extend(x)

for i in range(n-1, 0,-1):
    c[i] = min(c[2*i],c[2*i +1])

for k in range(q):
    p,a,b = map(int, input().split())
    if p == 1:
        d = n+a -1
        c[d] = b
        while d >1:
            d = d//2
            c[d] = min(c[2*d], c[2*d +1])
            
    if p ==2:
        l = n+a-1
        r = n+b-1
        s = 10**9 +1
        

        while l <= r:
            if r%2 == 0:
                s = min(s,c[r])
                r=r-1
                
            else:
                s = min(s,c[l])
                l=l+1
            l=l//2
            r=r//2
            
        print(s)

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER