Pagini recente » Cod sursa (job #1120089) | Cod sursa (job #2351657) | Cod sursa (job #1944912) | Cod sursa (job #1802679) | Cod sursa (job #978735)
Cod sursa(job #978735)
#include <fstream>
using namespace std;
int main()
{
int n,m;
long a[16][16],smax;
long i,j,k,s,t;
ifstream fi("flip.in");
ofstream fo("flip.out");
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;
}