Pagini recente » Cod sursa (job #2380061) | Cod sursa (job #2189961)
#include <iostream>
#include <fstream>
#include <vector>
#include <stdlib.h>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
long long N,M,F[17][17],sn,sp,S_max;
long long Suma[50],Mod[20],aux,Su,PU; // 1-comutare
int main()
{
f>>N>>M;
for(int i=1;i<=N;i++)
{
sn=0; sp=0;
for(int j=1;j<=M;j++)
{
f>>F[i][j];
if(F[i][j]<0) sn+=F[i][j];
else sp+=F[i][j];
}
if(abs(sn)>=sp)
{ Suma[i]=abs(sn)+(-1)*sp; Mod[i]=1; }
else { Suma[i]=sp+sn; Mod[i]=0; }
if(Suma[i]>S_max) S_max=Suma[i];
}
for(int i=1;i<=M;i++)
{
Su=0;
for(int j=1;j<=N;j++)
if(Mod[j]==0)
{
if(F[j][i]>0) Su=Su+Suma[j]-F[j][i];
else Su=Su+Suma[j]+F[j][i];
}
else
if(F[j][i]>0) Su=Su+Suma[j]+F[j][i];
else Su=Su+Suma[j]-F[j][i];
if(Su>S_max) S_max=Su; PU+=Su;
if(PU>S_max) S_max=PU;
} g<<S_max;
return 0;
}