Pagini recente » Cod sursa (job #2528480) | Autentificare | Cod sursa (job #2147023) | Cod sursa (job #2348767) | Cod sursa (job #708039)
Cod sursa(job #708039)
#include<stdio.h>
#define NMAX 20
#define INF 1<<32
long long int A[NMAX][NMAX],L[NMAX],C[NMAX],S,N,M,MAX=0-INF;
void deschidere()
{
freopen("flip.in","r",stdin);
freopen("flip.out","w",stdout);
}
void citire()
{
scanf("%lld%lld",&N,&M);
for(int i = 0 ; i < N ; i++)
for(int j = 0 ; j < M ; j++)
{
scanf("%lld",&A[i][j]);
S+=A[i][j],C[j]+=A[i][j],L[i]+=A[i][j];
}
}
void rezolva()
{
for(int i = 0 ; i < N; i++)
for(int j = 0 ; j < M;j++)
if(S - (2*L[i]) - (2*C[j]) > MAX )
MAX = S - (2*L[i]) - (2*C[j]);
printf("%lld",MAX);
}
int main()
{
deschidere();
citire();
rezolva();
return 0;
}