Pagini recente » Cod sursa (job #1214798) | Cod sursa (job #561225) | Cod sursa (job #2109771) | Cod sursa (job #1810632) | Cod sursa (job #2299376)
#include <bits/stdc++.h>
using namespace std;
ifstream in("flip.in");
ofstream out("flip.out");
int n,m,mx,a[20][20],semn[20];
void bk(int k)
{
if(k==m)
{
int S=0,s,i,j;
for(i=0;i<n;i++)
{
s=0;
for(j=0;j<m;j++)
s+=a[i][j]*semn[j];
S+=abs(s);
}
mx=max(mx,S);
return;
}
semn[k]=-1;
bk(k+1);
semn[k]=1;
bk(k+1);
}
int main()
{
in>>n>>m;
for(int i=0;i<n;i++)
for(int j=0;j<m;j++)
in>>a[i][j];
bk(0);
out<<mx;
return 0;
}