@numerix
ok then help me m getting NZEC in problem while i have submitted same in C++ my python code for problem is
n=int(input())
v=int(input())
s=0;
l=[]
while(s<=n-1):
integerinput=int(input())
l.append(integerinput)
s+=1
maxhere=maxsofar=i=j=k=0
while(i<=n-1):
if(maxhere+l[i] maxhere=max(0,maxhere+l[i])
i+=1
elif(maxhere+l[i]==v):
maxsofar=maxhere+l[i]
break
else:
maxsofar=max(maxhere,maxsofar)
maxhere=maxhere-l[k]
k+=1
print (maxsofar)
please check out..and match it output as given problem it will work in all case please help me..and tell me how to submit it ..looking forward for your helping hand..i am newbie in python and justed shifted from C++ to python