Pagini recente » Cod sursa (job #414722) | Cod sursa (job #3226247) | Cod sursa (job #1401522) | Cod sursa (job #193001) | Cod sursa (job #2265390)
#include <iostream>
#include <fstream>
#include <limits.h>
#include <cmath>
using namespace std;
ifstream fin ("flip.in");
ofstream fout("flip.out");
int sumamax,n,m,a[20][20],s[20],suma;
int main()
{
sumamax=INT_MIN;
fin>>n>>m;
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++)
{
fin>>a[i][j];
s[i]+=a[i][j];
}
int sizen=(1<<n)-1;
int sizem=(1<<m)-1;
for(int i=0; i<=sizen; i++)
for(int j=0; j<=sizem; j++)
{
suma=0;
for(int i1=1;i1<=n;i1++)
for(int j1=1;j1<=m;j1++){
if ( ((i>>(i1-1))&1) && ((j>>(j1-1))&1) )
suma+=a[i1][j1];
else if( ((i>>(i1-1))&1) || ((j>>(j1-1))&1) )
suma-=a[i1][j1];
else
suma+=a[i1][j1];
}
sumamax=max(sumamax,suma);
}
fout<<sumamax;
}