Pagini recente » Cod sursa (job #3138164) | Cod sursa (job #64041) | Cod sursa (job #3263927) | Cod sursa (job #1761975) | Cod sursa (job #552770)
Cod sursa(job #552770)
#include<fstream>
#include<iostream>
using namespace std;
int a[100][100],n,m,maxx=0;
int rec(int x,int y)
{
int i,j,s;
if(x!=n && y!=m)
{
if(y==m)
rec(x+1,1);
else rec(x,y+1);
for(j=1;j<=m;j++)
a[x][j]*=-1;
if(y==m)
rec(x+1,1);
else rec(x,y+1);
for(j=1;j<=m;j++)
a[x][j]*=-1;
for(j=1;j<=n;j++)
a[j][y]*=-1;
if(y==m)
rec(x+1,1);
else rec(x,y+1);
}
else
{
s=0;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
s+=a[i][j];
if(s>maxx) maxx=s;
return 0;
}
}
int main()
{
int i,j;
ifstream f("flip.in");
ofstream g("flip.out");
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
rec(1,1);
g<<maxx;
}