Pagini recente » Cod sursa (job #2893905) | Cod sursa (job #2923587) | Cod sursa (job #2462650) | Cod sursa (job #3177463) | Cod sursa (job #2460395)
#include <bits/stdc++.h>
#define NM 20
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int n,m,sMax,a[NM][NM];
bool viz[NM],st[NM];
void Read();
void Write();
void BKT(int);
int main()
{ Read();
BKT(1);
g<<sMax;
}
void Read()
{ f>>n>>m;
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++)
f>>a[i][j];
}
void Write()
{ int sum=0;
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++)
sum+=(st[i] || st[j+n] ? -a[i][j] : a[i][j]);
sMax=max(sMax,sum);
}
void BKT(int vf)
{ if(vf==m+n+1)
Write();
else
for(int i=0; i<=1; i++)
{ st[vf]=i;
BKT(vf+1);
}
}