Pagini recente » Cod sursa (job #2300978) | Cod sursa (job #1415554) | Cod sursa (job #1747551) | Cod sursa (job #1877830) | Cod sursa (job #1268943)
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
long a[16][16],n,m,sum,smax,st[16];
void back(int k)
{
int i,j,s,t;
if (k==m)
{
s=0;
for (i=0;i<n;i++)
{
for (t=j=0;j<m;j++)
if (st[j])
t+=-a[i][j];
else
t+=a[i][j];
s+=t<-t ? -t : t;
}
if (smax<s)
smax=s;
return;
}
st[k]=0;
back(k+1);
st[k]=1;
back(k+1);
}
int main()
{
int i,j;
f>>n>>m;
for (i=0;i<n;i++)
for (j=0;j<m;j++)
f>>a[i][j];
back(0);
g<<smax<<"\n";
return 0;
}