Pagini recente » Cod sursa (job #756447) | Cod sursa (job #2405064) | Cod sursa (job #1079485) | Cod sursa (job #2625175) | Cod sursa (job #2413995)
#include <fstream>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int a[30][30],n,m,maxim;
int suma()
{
int s=0;
int s1=0;
for(int i=1;i<=n;i++)
{
s=0;
for(int j=1;j<=m;j++)
s+=a[i][j];
if(s<0)
s*=-1;
s1+=s;
}
return s1;
}
void schimb(int k)
{
for(int i=1;i<=m;i++)
a[i][k]*=-1;
}
void back(int k)
{
if(k>n)
maxim=max(maxim,suma());
else
{
back(k+1);
schimb(k);
back(k+1);
}
}
int main()
{
fin>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
fin>>a[i][j];
back(1);
fout<<maxim;
return 0;
}