Pagini recente » Cod sursa (job #2962683) | Cod sursa (job #2715641) | Cod sursa (job #1351922) | Cod sursa (job #1397507) | Cod sursa (job #2443861)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream cin("flip.in");
ofstream cout("flip.out");
int n,m,i,j,Max=0;
cin>>n>>m;
int v[n+1][m+1],suma=0;
for (i=1; i<=n; i++) for (j=1; j<=m; j++) {cin>>v[i][j]; suma+=v[i][j];}
if (suma>Max) Max=suma; suma=0;
for (i=1; i<=n; i++) for (j=1; j<=m; j++)
{
suma=0;
for (int i2=1; i2<=n; i2++)
for (int j2=1; j2<=m; j2++)
if (i2==i || j2==j) suma+=v[i2][j2]*-1;
else suma+=v[i2][j2];
if (suma>Max) Max=suma;
}
cout<<Max;
return 0;
}