Pagini recente » Cod sursa (job #103967) | boji_round2 | Cod sursa (job #183424) | Cod sursa (job #1517462) | Cod sursa (job #438757)
Cod sursa(job #438757)
#include<stdlib.h>
#include<cstdio>
using namespace std;
int main()
{
int m,n,i,j,a[101][101],s,s1[101],s2[101],maxx=0,maxX=0;
freopen("flip.in","r",stdin);
freopen("flip.out","w",stdout);
scanf("%d%d",&m,&n);
for (i=1;i<=m;i++)
for (j=1;j<=n;j++)
scanf("%d",&a[i][j]);
for (i=1;i<=m;i++)
{
s2[i] = 0;
for (j=1;j<=n;j++)
s2[i] = s2[i] + a[i][j];
//if (s < 0)
//for (j=1;j<=n;j++)
//a[i][j] = - a[i][j];
}
for (i=1;i<=m;i++) if (maxx > s2[i]) maxx = s2[i], maxX = i;
for (j=1;j<=n;j++) a[maxX][j] = -a[maxX][j];
//printf("%d\n",maxX);
for (i=1;i<=n;i++)
{
s1[i] = 0;
for (j=1;j<=m;j++)
s1[i] = s1[i] + a[j][i];
//if (s1[i] < 0)
//for (j=1;j<=n;j++)
//a[j][i] = - a[j][i];
}
for (i=1;i<=n;i++) if (maxx > s1[i]) maxx = s1[i], maxX = i;
for (j=1;j<=m;j++) a[j][maxX] = -a[j][maxX];
//printf("%d\n",maxX);
s = 0;
for (i=1;i<=m;i++)
for (j=1;j<=n;j++)
s = s + a[i][j];
printf("%d",s);
return 0;
}