Pagini recente » Cod sursa (job #2145277) | Cod sursa (job #2222104) | Cod sursa (job #2327894) | Cod sursa (job #623570) | Cod sursa (job #243279)
Cod sursa(job #243279)
#include <fstream.h>
long a[17][17],max,sum;
int n,m,i,j;
void cit()
{
ifstream fin("flip.in");
fin>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
fin>>a[i][j];
a[i][0]+=a[i][j];
a[0][j]+=a[i][j];
}
fin.close();
}
int main()
{
cit();
max=0;
for(i=1;i<=n;i++)
{
if(a[i][0]<0)
{
a[i][0]=-a[i][0];
for(j=1;j<=m;j++)
{
a[0][j]-=2*a[i][j];
a[i][j]=-a[i][j];
}
}
max+=a[i][0];
}
sum=0;
for(j=1;j<=m;j++)
{
if(a[0][j]<0)
{
a[0][j]=-a[0][j];
for(i=1;i<=n;i++)
{
a[i][0]-=2*a[i][j];
a[i][j]=-a[i][j];
}
}
sum+=a[0][j];
}
ofstream fout("flip.out");
if(sum>max)
fout<<sum;
else
fout<<max;
fout.close();
return 0;
}