Pagini recente » Cod sursa (job #1767470) | Cod sursa (job #272438) | Cod sursa (job #660384) | Cod sursa (job #696421) | Cod sursa (job #2291355)
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int frec[20][20], n, m, Smax, v[20][20];
bool b[40];
void cont()
{
memset(frec, 0, sizeof(frec));
for(int p=1; p<=n; p++){
if(b[p]){
for(int q=1; q<=m; q++) frec[p][q]++;
}
}
for(int p=n+m; p>=n+1; p--){
if(b[p]){
for(int q=1; q<=n; q++) frec[q][n+m-p+1]++;
}
}
int S = 0;
for(int p=1; p<=n; p++){
for(int q=1; q<=m; q++){
if(frec[p][q]%2==0) S = S + v[p][q];
else S = S + (-v[p][q]);
}
}
Smax = max(Smax, S);
}
int Back(int k)
{
for(int i=0; i<=1; i++){
b[k] = i;
if(k == n+m) cont();
else Back(k+1);
}
}
int main()
{
f >> n >> m;
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++){
f >> v[i][j];
}
Back(1);
g << Smax << '\n';
return 0;
}