subarraysum.py

def maxsubarr(arr):
    
    h=len(arr)
    w=len(arr[0])
    bestsum=arr[0][0]
    bestcoords=None
    
    for lbeg in range(h):
        for cbeg in range(w):
            
            for lend in range(lbeg,h):
                for cend in range(cbeg,h):
                    
                    subsum=0
                    for l in range(lbeg,lend+1):
                        for c in range(cbeg,cend+1):
                            subsum+=arr[l][c]

                    if subsum==bestsum:
                        print "equal",bestsum
                    if subsum>=bestsum:
                        bestsum=subsum
                        bestcoords=((lbeg,cbeg),(lend,cend))
                        
    return bestcoords