Pagini recente » Cod sursa (job #2762652) | Cod sursa (job #1820995) | Cod sursa (job #1431077) | Cod sursa (job #3281950) | Cod sursa (job #3211402)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int n, m, b[20][20],a[20];
int main()
{
int j, i,smax = INT_MIN,stot;
fin >> n >> m;
for (i = 1; i <= n; i++)
for ( j = 1; j <= m; j ++)
fin >> b[i][j];
while (a[0] == 0)
{
stot = 0;
int s;
for ( i = 1; i <= n; i ++)
{
s = 0;
for ( j = 1; j <= m; j ++)
if(a[j] == 0) s+= b[i][j];
else s -= b[i][j];
stot += abs(s);
}
smax = max(smax,stot);
for (j = m; a[j] == 1; j--)
a[j] = 0;
a[j] = 1;
}
fout <<smax <<" ";
return 0;
}