Pagini recente » Cod sursa (job #671933) | Cod sursa (job #181147) | Cod sursa (job #2932220) | Cod sursa (job #813047) | Cod sursa (job #193478)
Cod sursa(job #193478)
#include"stdio.h"
#include"stdint.h"
#define vrt 1
#define orz 2
void afis();
int_fast32_t mx[30][30],SUM_MAX=-2000000000,SUM;
int_fast16_t n,m,g,h,st[100];
bool mn[30][30];
long sum()
{
long sum=0;
for(int g=1;g<=m;g++)for(int h=1;h<=n;h++)if(mn[h][g])sum+=mx[h][g];else sum-=mx[h][g];
return sum;
}
void flip(int x,int y)
{
if(y==vrt){for(int g=1;g<=n;g++)if(mn[g][x]==1)mn[g][x]=0;else mn[g][x]=1;return;}
else
{for(int g=1;g<=m;g++)if(mn[x][g]==1)mn[x][g]=0;else mn[x][g]=1;return;}
}
void fflip()
{
for(int g=1;g<=n+m;g++)
{
if(st[g])
{
if(g<=n)flip(g,orz);
else flip(g-n,vrt);}
}
}
void back(int k)
{
if(k==n+m+1)
{fflip();SUM=sum();if(SUM>SUM_MAX)SUM_MAX=SUM;fflip();}
else
{st[k]=0;back(k+1);st[k]=1;back(k+1);}
}
int main()
{
freopen("flip.in","r",stdin);freopen("flip.out","w",stdout);
scanf("%d%d",&n,&m);
for(g=1;g<=n;g++)for(h=1;h<=m;h++){scanf("%ld",&mx[g][h]);}
back(1);
printf("%ld\n",SUM_MAX);
return 0;
}