Pagini recente » Cod sursa (job #2660429) | Cod sursa (job #2744327) | Cod sursa (job #2606485) | Cod sursa (job #2673610) | Cod sursa (job #1983475)
#include <iostream>
#include <fstream>
#include <cstdlib>
#include <cmath>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
void sminima_smaxima(int v2[], int &s1, int &s2,int n2)
{
s1=0;s2=0;
int i;
for(i=1;i<=n2;i++)
s1=s1+v2[i];
for(i=1;i<=n2;i++)
v2[i]=v2[i]*-1;
for(i=1;i<=n2;i++)
s2=s2+v2[i];
}
int main()
{
system("color 4");
int n,m,i,j,v[102],sem,sn,si,sf=0;;
fin>>n>>m;
int a[n][18];
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
fin>>a[i][j];
sem=0;
do
{
sem=0;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
v[j]=a[i][j];
sminima_smaxima(v,sn,si,m);
if(si>sn)
{
for(j=1;j<=m;j++)
a[i][j]=a[i][j]*-1;
sem=1;
}
}
for(j=1;j<=n;j++)
{
for(i=1;i<=n;i++)
v[i]=a[i][j];
sminima_smaxima(v,sn,si,n);
if(si>sn)
{
for(i=1;i<=n;i++)
a[i][j]=a[i][j]*-1;
sem=1;
}
}
}
while(sem==0);
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
sf=sf+a[i][j];
fout<<sf;
return 0;
}