Pagini recente » Cod sursa (job #2161499) | Cod sursa (job #1396801) | Cod sursa (job #517405) | Cod sursa (job #2939399) | Cod sursa (job #1257521)
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
long long n,m,i,j,a[18][18],s,i2,j2,s1,mx;
int main()
{
f >> n >> m;
for(i = 1; i <= n; i++)
for(j = 1; j <= m; j++){
f >> a[i][j];
s += a[i][j];
}
for(i = 1; i <= n; i++){
for(j = 1; j <= m; j++){
s1 = s;
for(i2 = 1; i2 <= n ; i2++){
s1 -= 2*a[i2][j];
}
for(j2 = 1; j2 <= m ; j2++){
s1 -= 2*a[i][j2];
}
s1 += 4*a[i][j];
if(s1 > mx){
mx = s1;
}
}
}
g<<mx;
return 0;
}