Pagini recente » Cod sursa (job #462304) | Cod sursa (job #1676978) | Cod sursa (job #2591580) | Cod sursa (job #2946933) | Cod sursa (job #1781658)
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
long long i,j,N,M;
long a[20][20], maxim=0, s[20];
void cont()
{
long long sl, st=0, i, j;
for(i=1;i<=M;i++)
{
sl=0;
for(j=1;j<=N;j++)
sl+=s[j]*a[j][i];
if(sl<0)
sl=-sl;
st+=sl;
}
if(st>maxim)
maxim=st;
}
void back(int k)
{
if(k>N)
cont();
else
{
s[k]=1;
back(k+1);
s[k]=-1;
back(k+1);
}
}
int main()
{
f>>N>>M;
for(i=1;i<=N;i++)
for(j=1;j<=M;j++)
f>>a[i][j];
back(1);
g<<maxim;
f.close();
g.close();
return 0;
}