Pagini recente » Cod sursa (job #615688) | Cod sursa (job #2656396) | Cod sursa (job #2320215) | Cod sursa (job #824093) | Cod sursa (job #2351306)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int main()
{
int m,n,a[17][17],sumaTotala=0,maxp,maxn;
f>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
f>>a[i][j];
for(int j=1;j<=m;j++)
{
maxp=0;
maxn=0;
for(int i=1;i<=n;i++)
if(a[i][j]>=0)
maxp+=a[i][j];
else
maxn-=a[i][j];
if(maxn > maxp)
for(int i=1;i<=n;i++)
a[i][j]*=-1;
}
for(int i=1;i<=n;i++)
{
maxp=0;
maxn=0;
for(int j=1;j<=m;j++)
if(a[i][j]>=0)
maxp+=a[i][j];
else
maxn-=a[i][j];
if(maxn > maxp)
{
for(int j=1;j<=m;j++)
a[i][j]*=-1;
sumaTotala+=(-maxn);
}
else
sumaTotala+=maxp;
}
g<<sumaTotala;
return 0;
}