Pagini recente » Cod sursa (job #2590836) | Cod sursa (job #1923056) | Cod sursa (job #2597041) | Cod sursa (job #2844052) | Cod sursa (job #2469622)
#include<bits/stdc++.h>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int n, maxim=-INT_MAX, a[20][20], m;
void prod(int j)
{
for(int i=1; i<=n; i++)
a[i][j]*=-1;
}
void check()
{
int S=0;
for(int i=1; i<=n; i++)
{
int s=0;
for(int j=1; j<=m; j++)
s+=a[i][j];
if(s<0)
S-=s;
else
S+=s;
maxim=max(maxim, S);
}
}
void Back(int i)
{
if(i==m+1)
{
check();
return;
}
Back(i+1);
prod(i);
Back(i+1);
prod(i);
}
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<<maxim;
return 0;
}