Pagini recente » Cod sursa (job #2559743) | Cod sursa (job #125160) | Cod sursa (job #813452) | Cod sursa (job #3234382) | Cod sursa (job #1978748)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int maxx,x[20][20],n,m,s,c,a[3];
void suma()
{
s=0;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
{
c=x[i][j];
if(i==a[1])
c=c*(-1);
if(j==a[2])
c=c*(-1);
s=s+c;
}
}
void back(int i)
{
while(i!=0)
{
while(i<=2 && i!=0)
{
a[i]++;
if(a[1]>n || a[2]>m)
{
a[i]=0;
i--;
}
else
i++;
}
if(i>2)
{
suma();
if(s>maxx)
maxx=s;
i=2;
}
}
}
int main()
{
f>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
f>>x[i][j];
back(1);
g<<maxx;
return 0;
}