This program works fine but I am getting error when giving a larger number as inputs. The link for this problem is https://www.hackerearth.com/practice/data-structures/arrays/multi-dimensional/practice-problems/algorithm/monk-and-operations/description/
#include<stdio.h>
#include<stdlib.h>
#define MAX(a,b) (((a)>(b))?(a):(b))
int main(){
int m,n,i,j,matrsum,matcsum;
scanf("%d %d",&m,&n);
int a[m][n],v1,v2,v3,v4;
for(i=0;i<m;i++){
for(j=0;j<n;j++){
scanf("%d",&a[i][j]);
}
}
scanf("%d %d %d %d",&v1,&v2,&v3,&v4);
for(i=0;i<m;i++){
int rsum=0,risum=0,rusum=0;
for(j=0;j<n;j++){
rsum=rsum+abs(a[i][j]);
risum+=abs(a[i][j]+v1);
rusum+=abs(v2);
}
matrsum+=MAX(rsum,MAX(risum,rusum));
}
for(i=0;i<n;i++){
int csum=0,cisum=0,cusum=0;
for(j=0;j<m;j++){
csum=csum+abs(a[j][i]);
cisum+=abs(a[j][i]+v3);
cusum+=abs(v4);
}
matcsum+=MAX(csum,MAX(cisum,cusum));
}
printf("%d ",MAX(matrsum,matcsum));
}
Example Input(Worst Case)
2 2
227790993 -762740567
57519048 -247119797
266086776 904261341 -872001509 212276239