Pagini recente » Cod sursa (job #3144065) | Cod sursa (job #2905639) | Cod sursa (job #3185095) | Cod sursa (job #2256580) | Cod sursa (job #1302886)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fi("flip.in");
ofstream fo("flip.out");
long n,m,a[16][16],smax,i,j,k,s,t;
int main() {
fi>>n>>m;
for(i=0;i<n;i++)
for(j=0;j<m;j++)
fi>>a[i][j];
for(i=0;i<(1<<m);i++){
s=0;
for(k=0;k<n;k++){
for(t=j=0;j<m;j++)
if(i&(1<<j))
t+=-a[k][j];
else
t+=a[k][j];
s+=t<-t ?-t : t;
}
if(smax<s) smax=s;
}
fo<<smax;
return 0;
}