Pagini recente » Cod sursa (job #920188) | Cod sursa (job #2684125) | Cod sursa (job #58655) | Cod sursa (job #560279) | Cod sursa (job #2215055)
//
// main.cpp
// 003
//
// Created by adrian ilisei on 20/06/2018.
// Copyright © 2018 adrian ilisei. All rights reserved.
//
#include <fstream>
#include <iostream>
using namespace std;
int main() {
ifstream f("flip.in");
ofstream g("flip.out");
int m, n;
int pozm = 0, pozn = 0;
long v[16][16];
f>>n>>m;
long long maxSum = 0;
long long currentSum = 0;
for(int i=0; i<n; i++)
{
for(int j=0; j<m; j++)
{
f>>v[i][j];
}
}
for(int i=0; i<m; i++)
{
for(int j=0; j<n; j++)
{
currentSum = 0;
for(int k=0; k<m; k++)
currentSum += -v[k][j];
for(int k=0; k<n; k++)
currentSum += -v[i][k];
if(i==0 && j==0)
{
maxSum = currentSum;
pozm = i;
pozn = j;
} else
{
if(currentSum > maxSum)
{
maxSum = currentSum;
pozm = i;
pozn = j;
}
}
}
}
maxSum = 0;
for(int i=0; i<m; i++)
for(int j=0; j<n; j++)
{
if(i==pozm && j==pozn)
{
maxSum -= v[i][j];
} else
{
maxSum += v[i][j];
}
}
g<<maxSum;
return 0;
}