What is the problem in this maximum sum submatrix code?
for(int j=m-1; j>0; j++){
for(int i=n-1; i>0; i++){
a[i-1][j]=a[i-1][j]+a[i][j];
}
}
in these loop i– will comes instead of i++
same thing for j
for(int j=m-1; j>0; j++){
for(int i=n-1; i>0; i++){
a[i-1][j]=a[i-1][j]+a[i][j];
}
}
in these loop i– will comes instead of i++
same thing for j