Pagini recente » Cod sursa (job #1267002) | Cod sursa (job #1686151) | Cod sursa (job #1561288) | Cod sursa (job #2215492) | Cod sursa (job #471766)
Cod sursa(job #471766)
#include <fstream>
using namespace std;
ifstream in("flip.in");
ofstream out("flip.out");
int n,a[17][17],m;
bool sol[20];
void read()
{
in>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
in>>a[i][j];
}
int sum=0,s[17],smax;
void prelucrare()
{
sum=0;
for(int i=1;i<=n;i++)
{
s[i]=0;
for(int j=1;j<=m;j++)
if(sol[j])
s[i]+=a[i][j];
else
s[i]-=a[i][j];
if(s[i]<0)
sum-=s[i];
else
sum+=s[i];
}
if(sum>smax)
smax=sum;
}
void bkt(int p)
{
if(p==m+1)
{
prelucrare();
return;
}
sol[p]=false;
bkt(p+1);
sol[p]=true;
bkt(p+1);
}
int main()
{
read();
bkt(1);
out<<smax;
return 0;
}