Pagini recente » Cod sursa (job #1362528) | Cod sursa (job #1649584) | Cod sursa (job #876685) | Cod sursa (job #2271152) | Cod sursa (job #1615044)
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int s[100],n,m,a[17][17];
long long tmax=-999999999;
void calcul()
{
long long t=0,s1;
int i,j;
for(j=1;j<=m;j++)
{ s1=0;
for(i=1;i<=n;i++)
if(s[i]) s1=s1-a[i][j];
else s1=s1+a[i][j];
if(s1<0) t=t-s1;
else t=t+s1;
}
if(t>tmax) tmax=t;
}
void genereaza(int k)
{
for(int i=0;i<=1;i++)
{
s[k]=i;
if(k==n) calcul();
else genereaza(k+1);
}
}
int main()
{ f>>n>>m;
int i,j;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++) f>>a[i][j];
genereaza(1);
g<<tmax<<'\n';
f.close();g.close();
return 0;
}