Pagini recente » Cod sursa (job #3213137) | Cod sursa (job #1131087) | Cod sursa (job #1846927) | Cod sursa (job #2517897) | Cod sursa (job #1289185)
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
long a[17][17],ls[17],m,n,smax;
void bkt(int k)
{
int i,j,s,sl;
if(k==m+1)
{
s=0;
for(i=0;i<m;i++)
{
for(sl,j=0;j<n;j++)
{
if(ls[j])
sl+=-a[i][j];
else
sl+=a[i][j];
}
s+=sl<-sl ? -sl:sl;
}
if(smax<s)
smax=s;
return;
}
ls[k]=0;
bkt(k+1);
ls[k]=1;
bkt(k+1);
}
int main()
{
int i,j;
f>>m>>n;
for(i=0;i<m;i++)
for(j=0;j<n;j++)
f>>a[i][j];
bkt(1);
g<<smax<<"\n";
return 0;
}