Pagini recente » Cod sursa (job #2026090) | Cod sursa (job #3238364) | Cod sursa (job #995760) | Cod sursa (job #1164946) | Cod sursa (job #834092)
Cod sursa(job #834092)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
long a[17][17],n,m,i,j,k,s=0,semn[17];
void calcul()
{
long rez[17]={0}, aux=0;
for(j=1;j<=m;j++)
for(i=1;i<=n;i++)
rez[j]=rez[j]+a[i][j]*semn[i];
for(i=1;i<=m;i++)
if(rez[i]>0)
aux=aux+rez[i];
else
aux=aux-rez[i];
if(aux>s)
s=aux;
}
void back(int k)
{
if(k==n+1)
calcul();
else
{
semn[k]=1;
back(k+1);
semn[k]=-1;
back(k+1);
}
}
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
back(1);
g<<s;
f.close();
g.close();
return 0;
}