Pagini recente » Cod sursa (job #1098849) | Cod sursa (job #1308223) | Cod sursa (job #1990876) | Cod sursa (job #1910360) | Cod sursa (job #1185296)
#include <iostream>
#include<fstream>
using namespace std;
int main()
{
fstream f,g;
f.open("flip.in",ios::in);
g.open("flip.out",ios::out);
int n,m,i,j,s=0,maxim=-1000000000,A[18][18],ok=0,x[18]={0};
f>>n>>m;
for(i=1; i<=n; i++)
for(j=1; j<=m; j++)
{
f>>A[i][j];
s=s+A[i][j];
}
if(s>maxim)
maxim=s;
int s1=0;
while(ok==0)
{
s=0;
for(j=1; j<=m; j++)
{
s1=0;
for(i=1; i<=n; i++)
if(x[i]==1)
s1=s1-A[i][j];
else
s1=s1+A[i][j];
if(s1<0)
s1=0-s1;
s=s+s1;
}
if(s>maxim)
maxim=s;
x[1]++;
i=1;
while(x[i]==2)
{
x[i]=0;
i++;
x[i]++;
}
if(i>=n && x[n]==0)
ok=1;
}
cout<<maxim;
}