Pagini recente » Cod sursa (job #2625037) | Cod sursa (job #2617307) | Cod sursa (job #2234715) | Cod sursa (job #1544132) | Cod sursa (job #955042)
Cod sursa(job #955042)
#include <cstdio>
using namespace std;
int a[30][30],b[30][30],gen1[30];
int main()
{
int n,m,i,j;
long long int s,maxim,suma;
freopen ("flip.in","r",stdin);
freopen ("flip.out","w",stdout);
scanf("%d", &n);scanf("%d", &m);
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
scanf("%d", &a[i][j]);
maxim=0;
while(gen1[0]==0)
{
for(i=1;i<=n;i++)
if(gen1[i]==0)
for(j=1;j<=m;j++)
b[i][j]=a[i][j];
else
for(j=1;j<=m;j++)
b[i][j]=-a[i][j];
suma=0;
for(i=1;i<=m;i++)
{
s=0;
for(j=1;j<=n;j++)
s+=b[j][i];
if(s<0)
suma=suma-s;
else
suma=suma+s;
}
if(suma>maxim)
maxim=suma;
i=n;
while(gen1[i]==1)
gen1[i--]=0;
gen1[i]++;
}
printf("%d\n", maxim);
return 0;
}