Given a 2D array, find the maximum sum subarray in it. For example, in the following 2D array, the maximum sum subarray is highlighted with blue rectangle and sum of this subarray is 29.
Input:
First line of every test case consists of T test case. First line of every test case consists of 2 integers R and C , denoting number of rows and columns. Second line consists of R*C spaced integers denoting number of elements in array.
Output:
Single line output, print the Max sum forming a rectangle in a 2-D matrix
Example:
Input:
1
4 5
1 2 -1 -4 -20 -8 -3 4 2 1 3 8 10 1 3 -4 -1 1 7 -6
Ouptut:
29
** For More Input/Output Examples Use 'Expected Output' option **
Author: saksham seth
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.
Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.
| bruceewayne | 175 |
| manvirag982 | 158 |
| Core_Ka_Bachha | 137 |
| yash_sharan | 136 |
| rajupraaa1234 | 133 |
| mr_kksparrow | 433 |
| manvirag982 | 374 |
| rajupraaa1234 | 268 |
| Exception_404 | 254 |
| PranathiBhuvanagiri | 242 |
| blackshadows | 5331 |
| Ibrahim Nash | 5219 |
| akhayrutdinov | 5111 |
| mb1973 | 4929 |
| Quandray | 4567 |