Pagini recente » Cod sursa (job #2550632) | Cod sursa (job #2286388) | Cod sursa (job #841310) | Cod sursa (job #1281415) | Cod sursa (job #1000154)
#include <fstream>
using namespace std;
int i,k,l,maxi,s,j,n,m,a[17][17],ok;
ifstream f("flip.in");
ofstream g("flip.out");
void flip(int k,int l)
{
int s=0;
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
if ((i==k && j==l) || (i!=k && j!=l)) s+=a[i][j];
else s-=a[i][j];
if (s>maxi) maxi=s;
while (ok==0)
{
if (k<n && l==m) k++,l=0;
if (k==n && l==m-1) ok=1;
flip(k,l+1);
}
}
int main()
{
f>>n>>m;
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
f>>a[i][j];
flip(1,1);
g<<maxi;
return 0;
}