Given an $n \times n$ matrix $A$ of integers, find $i, j, k,l \in [n]$ with $i \leq j, k \leq l$ maximizing $\sum^j_{x=i}\sum^l_{y=k}A[x,y]$, that is, find a contiguous subarray of $A$ of maximum sum