- #1
Jamin2112
- 986
- 12
This is a challenge problem I thought of: Given a real-valued matrix A, develop an algorithm that finds the submatrix with the greatest sum of its element. (If there's a tie, just return an arbitrary submatrix that's tied for the win.)
Is there a way other than brute force?
Is there a way other than brute force?