Cod sursa(job #927120)
Utilizator | Chitanu Stefan Petru CStefanP | Data | 25 martie 2013 16:32:16 |
---|---|---|---|
Problema | Jocul Flip | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.72 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int n,m,a[17][17],v[17];
long long sol=-1000000000;
void bckt(int k)
{
long long s,sum;
if(k==n+1)
{
sum=0;
for(int i=1;i<=m;i++)
{
s=0;
for(int j=1;j<=n;j++)
s+=a[i][j]*v[j];
if(s<0)sum-=s;
else sum+=s;}
sol=max(sol,sum);
return;
}
v[k]=1;
bckt(k+1);
v[k]=-1;
bckt(k+1);
}
int main()
{
f>>m>>n;
for(int i=1;i<=m;i++)
for(int j=1;j<=n;j++)
f>>a[i][j];
bckt(1);
g<<sol;
}