Pagini recente » Cod sursa (job #587993) | Cod sursa (job #820021) | Cod sursa (job #1296401) | Profil dornescuvlad | Cod sursa (job #1130807)
#include <iostream>
#include <fstream>
using namespace std;
int n,m,a[17][17],p=0;
int main()
{
ifstream fin("flip.in");
ofstream fout("flip.out");
fin>>n>>m;
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++)
{
fin>>a[i][j];
p+=a[i][j];
}
fin.close();
int S,s;
for(int k=m; k--; k>=1)
{
S=0;
for(int i=1; i<=n; i++)
{
s=0;
for(int j=1; j<=m; j++)
{
if(j==k) s-=a[i][j];
else s+=a[i][j];
}
if(s<0) s*=(-1);
S+=s;
}
if(S>p) p=S;
}
fout<<p;
fout.close();
return 0;
}