Pagini recente » Cod sursa (job #462569) | Cod sursa (job #1735247) | Cod sursa (job #349851) | Cod sursa (job #1571835) | Cod sursa (job #1385950)
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
long a[16][16],n,m,sum,smax,st[16],s;
void back(int k)
{
int i,j,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+=max(t,-t);
}
smax=max(s,smax);
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;
}