Pagini recente » Cod sursa (job #1632169) | Cod sursa (job #549107) | Cod sursa (job #1478585) | Cod sursa (job #581362) | Cod sursa (job #3240495)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int N,M,A[16][16],maxim;
int main(){
f>>N>>M;
for(int i=0;i<N;i++)
for(int j=0;j<M;j++)
f>>A[i][j];
for(int mask = 0; mask < (1 << N); ++mask)
{
int sc[20]={0}, s=0;
for(int i=0;i<N;i++)
for(int j=0;j<M;j++)
sc[j] += ((mask & (1<<i)) ? (A[i][j]) : (-A[i][j]));
for(int j=0;j<M;j++)
s+= ((sc[j] > 0) ? (sc[j]) : (-sc[j]));
maxim = max(maxim, s);
}
g<<maxim;
return 0;
}