Pagini recente » Cod sursa (job #2398251) | Cod sursa (job #2268326) | Cod sursa (job #258205) | Cod sursa (job #1840212) | Cod sursa (job #2532058)
#include <fstream>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int a[20][20],n,m,i,j,v[20],Max=-2000000000,ss,s;
int main()
{
fin>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
fin>>a[i][j];
while(v[0]==0)
{
i=n;
while(v[i]==1)
{v[i]=0;
i--;}
v[i]=1;
s=0;
for(j=1;j<=m;j++)
{
ss=0;
for(i=1;i<=n;i++)
{
if(v[i]==1)
ss+=a[i][j];
else
ss-=a[i][j];
}
s+=max(ss,-ss);
}
if(s>Max)
Max=s;
}
fout<<Max;
return 0;
}