Pagini recente » Cod sursa (job #1104256) | Cod sursa (job #1629150) | Cod sursa (job #2352244) | Cod sursa (job #43684) | Cod sursa (job #1293666)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int a[17][17],n,m,N,sMax,st[40],l[17],c[17];
void test()
{
int s=0,j,i,k,sum;
for(i=1;i<=n;i++)
{sum=0;
for(j=1;j<=m;j++)
if(st[j]==1)
sum-=a[i][j];
else
sum+=a[i][j];
if(sum<0)
s=s-sum;
else
s=s+sum;
if(s>sMax)
sMax=s;
}
}
void back(int k)
{ for(int i=0;i<=1;i++)
{st[k]=i;
if(k==m)
test();
else
back(k+1);
}
}
int main()
{
fin>>n>>m;
int i, j;
for(i=1; i<=n; i++)
{
for(j=1; j<=m; j++)
{ fin>>a[i][j];
sMax+=a[i][j];
l[i]+=a[i][j];
}
}
back(1);
fout<<sMax;
}