#kadane\'s algorithm def seq(n,size): meh=0 msf=-100 for i in range(0,size): meh=meh+n[i]; if(mehmsf): msf=meh; return max(msf,meh)