OJ Board

Hello, there.

I was trying to improve my N^4 solution to the maximal submatrix
problem (p108), and ended up with an N^3 version, using Kadane's Algorithm.

Then, I wondered if I could adapt it to use a fixed size submatrix (NxN).
I just summed the N first digits, and in each step of the iteration ...

vinit_iiita wrote: for input
-9 -9
9 -9

A set contains unique elements. It cannot have (by definition) -9 listed twice. So I guess this case can't be tested.