Pagini recente » Cod sursa (job #2290664) | Cod sursa (job #374274) | Cod sursa (job #2411957) | Cod sursa (job #1455090) | Cod sursa (job #3124591)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int n,m,a[17][17],smax,x[17];
void rezolva()
{
int S=0;
for(int i=1;i<=n;i++)
{
int s=0;
for(int j=1;j<=m;j++)
if(x[j])
s-=a[i][j];
else
s+=a[i][j];
if(s<0)
S-=s;
else
S+=s;
}
if(S>smax)
smax=S;
}
void back(int k)
{
for(int i=0;i<=1;i++)
{
x[k]=i;
if(k==m)
rezolva();
else
back(k+1);
}
}
int main()
{
f>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
f>>a[i][j];
back(1);
g<<smax;
return 0;
}