Pagini recente » Cod sursa (job #436882) | Cod sursa (job #1959064) | Cod sursa (job #633747) | Cod sursa (job #1559192) | Cod sursa (job #1114069)
using namespace std;
#include <fstream>
#include <vector>
#include <algorithm>
ifstream fin("flip.in");
ofstream fout("flip.out");
int m, n, max1=0; // n linii m coloane
int t[16][16];
vector <bool> v(32, 0);
int main()
{
int i, j, k, var, s;
fin>>m>>n;
var=(1<<(m+n));
for(i=0; i<n; i++)
for(j=0; j<m; j++)
fin>>t[i][j];
for(k=0; k<var; k++)
{
s=0;
for(i=0; i<n; i++)
for(j=0; j<m; j++)
if(v[i]==v[n+j]) s+=t[i][j];
else s-=t[i][j];
if(s>max1) max1=s;
for(i=m+n-1; i>=0 && v[i]==1; i--) v[i]=0;
if(i>=0) v[i]=1;
}
fout<<max1;
return 0;
}