Pagini recente » Cod sursa (job #934701) | Cod sursa (job #419329) | Cod sursa (job #3218980) | Cod sursa (job #731799) | Cod sursa (job #1553300)
#include <cstdio>
using namespace std;
int a[18][18], smax, v[2]={-1, 1}, st[18], n, m;
int maxim(int a, int b){
if(a>b)
return a;
return b;
}
void verificare(){
int s,i,j, sm=0;
for(i=1;i<=n;i++)
{
s=0;
for(j=1;j<=m;j++)
s+=st[j]*a[i][j];
if(s<0)
s*=-1;
sm+=s;
}
smax=maxim(smax, sm);
}
void bkt(int k)
{
int i;
if(k==m+1)
verificare();
else{
for(i=0;i<2;i++){
st[k]=v[i];
bkt(k+1);
}
}
}
int main()
{
freopen("flip.in", "r", stdin);
freopen("flip.out", "w", stdout);
int i, j;
scanf("%d%d", &n, &m);
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
scanf("%d", &a[i][j]);
bkt(1);
printf("%d", smax);
return 0;
}