Pagini recente » Cod sursa (job #3155880) | Cod sursa (job #2689680) | Cod sursa (job #2940765) | Cod sursa (job #2746793) | Cod sursa (job #1828333)
#include <cstdio>
using namespace std;
int a[17][17];
int n,m;
int suma (int indice,int lincol)
{
int s=0;
if(lincol==1)
for(register int j=1;j<=m;j++)
s=s+a[indice][j];
if(lincol==2)
for(register int i=1;i<=n;i++)
s=s+a[i][indice];
return s;
}
void minusunu (int indice,int lincol)
{
if(lincol==1)
if(lincol==1)
for(register int j=1;j<=m;j++)
a[indice][j]=a[indice][j]*(-1);
if(lincol==2)
for(register int i=1;i<=n;i++)
a[i][indice]=a[i][indice]*(-1);
}
int main()
{
freopen("flip.in","r",stdin);
freopen("flip.out","w",stdout);
int i,j,ok=0,sumamax=0;
scanf("%d %d",&n,&m);
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
scanf("%d",&a[i][j]);
do
{
ok=1;
for(i=1;i<=n;i++)
{
if(suma(i,1)<0)
{
minusunu(i,1);
ok=0;
}
}
for(j=1;j<=m;j++)
{
if(suma(j,2)<0)
{
minusunu(j,2);
ok=0;
}
}
}while(ok==0);
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
sumamax=sumamax+a[i][j];
printf("%d",sumamax);
return 0;
}