Pagini recente » Cod sursa (job #3261378) | Cod sursa (job #2269370) | Runda 2 preONI 2007 | Cod sursa (job #2822870) | Cod sursa (job #282125)
Cod sursa(job #282125)
#include <fstream>
using namespace std;
long int maxi=-1000000000,n,m,v[20],a[20][20];
void maxim()
{
int i,j,x,s=0;
for(i=1;i<=n;i++)
{
x=0;
for(j=1;j<=m;j++)
x+=v[j]*a[i][j];
if(x>0) s+=x;
else s+=-x;
}
if(s>maxi) maxi=s;
}
void back (int k)
{
if(k==m) maxim();
else
{
v[k+1]=1; back(k+1);
v[k+1]=-1; back(k+1);
}
}
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];
back(0);
g<<maxi<<"\n";
f.close();
g.close();
return 0;
}