Pagini recente » Cod sursa (job #1769771) | Cod sursa (job #2441677) | Monitorul de evaluare | Cod sursa (job #2048555) | Cod sursa (job #1292635)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
int a[17][17], n, m, N;
int sMax;
int st[40];
int l[17];
int c[17];
ifstream f("flip.in");
ofstream g("flip.out");
void test()
{
int s=0,j,i,k,sum;
for(i=1;i<=n;i++)
{sum=0;
for(j=1;j<=m;j++)
if(st[j]==1)
sum-=a[i][j];
else
sum+=a[i][j];
if(sum<0)
s=s-sum;
else
s=s+sum;
if(s>sMax)
sMax=s;
}
}
void back(int k)
{ for(int i=0;i<=1;i++)
{st[k]=i;
if(k==m)
test();
else
back(k+1);
}
}
int main()
{
f>>n>>m;
int i, j;
for(i=1; i<=n; i++)
{
for(j=1; j<=m; j++)
{ f>>a[i][j];
sMax+=a[i][j];
l[i]+=a[i][j];
}
// cout<<l[i]<<endl;
}
//cout<<sMax;
//for(i=1;i<=m;i++)
// cout<<c[i]<<" ";
//cout<<endl;
// cout<<sMax<<endl;
N=n+m;
int r=1, s, k;
back(1);
g<<sMax;
return 0;
}