getting NZEC in test case 8 in RPLN - Negative Score
M=10**9+7
def build(node,start,end):
if start==end:
tree[node]=a[start]
else:
mid=(start+end)//2
build(2node,start,mid)
build(2node+1,mid+1,end)
tree[node]=min(tree[2node],tree[2node+1])
def query(node,a,b,start,end):
if bend:
return M
if start>=a and end<=b:
return tree[node]
mid=(start+end)//2
return min(query(2node,a,b,start,mid),query(2node+1,a,b,mid+1,end))
for i in range(input()):
n,q=map(int,raw_input().split())
tree=[0](2n)
a=map(int,raw_input().split())
build(1,0,n-1)
print “Scenario #”+str(i+1)+":"
#print tree
for _ in range(q):
a,b=map(int,raw_input().split())
print query(1,a,b,1,n)