Pagini recente » Cod sursa (job #791896) | Cod sursa (job #2361501) | Cod sursa (job #498550) | Cod sursa (job #3170456) | Cod sursa (job #1109107)
#include<fstream>
using namespace std;
int a[20][20],s[20],n,m,i,j,k;
long long suma,S,solutie=-(1<<30);
int main()
{
ifstream fin("finlip.in");
ofstream fout("finlip.out");
fin>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
fin>>a[i][j];
k=1; s[1]=3;
while(k>0)
if(s[k]>-1)
{ s[k]-=2;
if(k==m)
{ S=0;
for(i=1;i<=n;i++)
{suma=0;
for(j=1;j<=m;j++)
if(s[j]==-1) suma+=a[i][j]*(-1);
else suma+=a[i][j];
if(suma<0) suma*=(-1);
S+=suma;
}
if(S>solutie) solutie=S;
}
else {k++; s[k]=3;}
}
else k--;
fout<<solutie;
fin.close();
fout.close();
return 0;
}