Pagini recente » Cod sursa (job #777841) | Cod sursa (job #102975) | Cod sursa (job #1141892) | Cod sursa (job #709547) | Cod sursa (job #878800)
Cod sursa(job #878800)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int x[40],n,m,a[20][20],i,j,smax;
void comp()
{
int s,y;
for(y=0;y<(1<<m);y++)
{
s=0;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
if(x[i]+((y>>(j-1))&1)==1)
s=s-a[i][j];
else
s=s+a[i][j];
if (s>smax)smax=s;
}}
void bt(int k)
{
for(int i=0;i<=1;i++)
{x[k]=i;
if(k==n) comp();
else bt(k+1);
}
}
int main()
{f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
bt(1);
g<<smax;
g.close();
return 0;
}