2D Maximum Subarray: Revision history

10 April 2023

• curprev 09:2309:23, 10 April 2023‎ Admin talk contribs‎ 1,454 bytes +2‎ No edit summary

15 February 2023

• curprev 13:0313:03, 15 February 2023‎ Admin talk contribs‎ 1,452 bytes −11‎ No edit summary

• curprev 11:2311:23, 15 February 2023‎ Admin talk contribs‎ 1,463 bytes +1,463‎ Created page with "{{DISPLAYTITLE:2D Maximum Subarray (Maximum Subarray Problem)}} == Description == 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 == Related Problems == Generalizations: Maximum Subarray Related: 1D Maximum Subarray, Maximum Square Subarray == Parameters == <pre>n: dimension of array</pre> == Table o..."