Pagini recente » Cod sursa (job #2509525) | Cod sursa (job #2243117) | Cod sursa (job #1042596) | Cod sursa (job #575134) | Cod sursa (job #1825855)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int a[21][21];
int v[21];
int main()
{int n,m,i,j,z,p,s=0,smax=-1,sum,k;
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
p=(1<<m);
for(k=0;k<=p;k++)
{
for(i=1;i<=m;i++)
v[i]=0;
s=0;
for(j=1;j<=m; j++)
if((1<<(j-1)&k)>0)
v[j]=1;
for(i=1;i<=n;i++)
{
sum=0;
for(j=1;j<=m;j++)
if(v[j]==1)
sum-=a[i][j];
else
sum+=a[i][j];
if(sum<0)
s=s-sum;
else
s=s+sum;
}
if (s>smax)
smax=s;
}
g<<smax;
return 0;
}