Pagini recente » Cod sursa (job #1822733) | Cod sursa (job #2720763) | Cod sursa (job #2265894) | Cod sursa (job #267994) | Cod sursa (job #564181)
Cod sursa(job #564181)
#include <cstdio>
using namespace std;
#define oo 0x3f3f3f3
#define hg 8192
int flip[17][17];
int M, N, poz;
int MAX = -oo;
char ch[hg];
inline void LN(const int l)
{
for (int i = 0; i < M; i++)
flip[l][i] = -flip[l][i];
}
void solve()
{
int suma = 0; int sumi = 0;
for (int i = 0; i < M; i++, sumi = 0)
{
for (int j = 0; j < N; j++)
sumi += flip[j][i];
suma += sumi > 0 ? sumi : -sumi;
}
if (suma > MAX) MAX = suma;
}
void back(const int k)
{
if (k == N) solve() ;
else
for (int i = 1; i <= 2; i++)
back (k + 1), LN(k);
}
int main()
{
freopen("flip.in","r",stdin);
freopen("flip.out","w",stdout);
scanf ("%d%d", &N, &M);
for (int i = 0; i < N; i++)
for (int j = 0; j < M; j++)
scanf ("%d", &flip[ i ][ j ]);
back(0);
printf("%d\n",MAX);
return 0;
}