Pagini recente » Borderou de evaluare (job #123172) | Cod sursa (job #3210558)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int n,m,i,j,x,a[25][25],sumax=INT_MIN;
bool linie[25]; //pastrez liniile pe care le iau;
void suma()
{
int crnt_sum = 0;
int s[17]={};
for(i=1; i<=n; i++)
for(j=1; j<=m; j++)
{
if(linie[i])
x = -a[i][j]; //flip-uit;
else x = a[i][j];
s[j]+=x; ///ATENTIE SA NU PIERD SGN-urile initiale
}
for(j=1; j<=m; j++)
{
if(s[j] < 0) s[j]*=-1; //flip-uim toata coloana
crnt_sum+=s[j]; //suma totala a matricei, prin coloane
}
if(crnt_sum > sumax) sumax = crnt_sum;
}
void back(int val)
{
if(val > n)
suma();
else
{
linie[val] = 1;
back(val+1);
linie[val] = 0;
back(val+1);
}
}
int main()
{
fin>>n>>m;
for(i=1; i<=n; i++)
for(j=1; j<=m;j++)
fin>>a[i][j];
back(1);
fout<<sumax;
return 0;
}