Pagini recente » Cod sursa (job #1751960) | Cod sursa (job #735750) | Cod sursa (job #2379795) | Cod sursa (job #1914349) | Cod sursa (job #2414471)
#include <fstream>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int n,m,i,j,sum,sl,maxim,a[20][20];
bool ok,v[20];
int main()
{
fin >> n >> m;
maxim=-2000000005;
for (i=1;i<=n;i++) for (j=1;j<=m;j++) fin >> a[i][j];
while (ok==0)
{
i=n;
while (v[i]==1)
{
v[i]=0;
i--;
}
v[i]=1;
sum=0;
for (j=1;j<=m;j++)
{
sl=0;
for (i=1;i<=n;i++) if (v[i]==0) sl+=a[i][j];
else sl-=a[i][j];
if (sl<0) sl*=-1;
sum+=sl;
}
if (sum>maxim) maxim=sum;
if (v[0]==1) ok=1;
}
fout << maxim;
return 0;
}