Pagini recente » Cod sursa (job #807742) | Cod sursa (job #2145352) | Cod sursa (job #2785179) | Cod sursa (job #1660080) | Cod sursa (job #1461118)
#include<fstream>
using namespace std;
int maxi(int a,int b)
{
return a>b ? a:b ;
}
ifstream in("flip.in");
ofstream out("flip.out");
int N,M;
int T[20][20],colSum[20],rowSum[20],tSum,result;
int main()
{
in>>N>>M;
for(int i=0;i<N;i++)
for(int j=0;j<M;j++)
in>>T[i][j];
for(int i=0;i<N;i++)
for(int j=0;j<M;j++)
{
tSum=tSum+T[i][j];
colSum[j]=colSum[j]+T[i][j];
rowSum[i]=rowSum[i]+T[i][j];
}
for(int rowsBits=0; rowsBits<(1<<N); rowsBits++)
{
int sum=tSum;
for(int i=0;i<N;i++)
if( ((1<<i) & rowsBits)>0)
sum=sum-2*rowSum[i];
for(int j=0;j<M;j++)
{
int newSum=sum-2*colSum[j];
for(int i=0;i<N;i++)
if( ((1<<i) & rowsBits)>0)
newSum=newSum+4*T[i][j];
sum=max(sum,newSum);
}
result=max(result,sum);
}
out<<result<<endl;
return 0;
}