Pagini recente » Cod sursa (job #1846961) | Cod sursa (job #860596) | Cod sursa (job #702438) | Cod sursa (job #1285225) | Cod sursa (job #256158)
Cod sursa(job #256158)
#include<fstream.h>
#include<iostream.h>
long a[30][30],max=-30000;
int n,m;
int st[40],k;
void tipar()
{int s=0;
for(int i=1;i<n+1;i++)
for(int j=1;j<m+1;j++)
if((st[i]+st[n+j])%2==0) s+=a[i][j]; else s-=a[i][j];
if(s>max) max=s;
}
void back(int k)
{int i; if(k==n+m+1) tipar(); else
for(i=0;i<2;i++)
{ st[k]=i; back(k+1); } }
int main()
{ int i,j;
ifstream f("flip.in");
ofstream g("flip.out");
f>>n>>m;
for(i=1;i<n+1;i++)
for(j=1;j<m+1;j++)
f>>a[i][j];
back(1);
g<<max;
return 0; }