Hey; Here here is the problem.I write a solution , but i could not found where my bug is :(

~~~~~ ~~~~~ Could you guys find the bug please ? Edit:Ok i got it.

You will read the number N (1<=N<=100) than i will give you N*N numbers. I want you to find the rectangle which is has the most sum and print its sum. Input: 5 1 2 3 4 5 1 -5 -20 -40 4 -8 -7 5 6 2 -5 2 -4 -8 9 1 -5 -8 -5 2 Output: 22 Is this problem has a solution better than o(n^4) ?

In this submisson: 2431151 In that line: "if(hour[i]==hour[i-1]&&min[i]==min[i-1]){"

In the beginning, i=0 so that hour[i-1] means hour[-1].Can someone please explain how can this pass the pretests?

A

a