Pagini recente » Cod sursa (job #3151355) | Cod sursa (job #2593267) | Cod sursa (job #2404861) | Cod sursa (job #2675516) | Cod sursa (job #1097041)
#include <fstream>
using namespace std;
int n,m,v[17];
long a[17][17],t=0,i,j;
void back(int k){
if(k>n)
{ long x,s;
for(i=1,x=0;i<=n;i++)
{
for(j=1,s=0;j<=m;j++)
s+=a[i][j]*v[j];
x+=(s>0)?s:-s;
}
if(x>t) t=x;
}
else{
v[k]=1;
back(k+1);
v[k]=-1;
back(k+1);
}
}
int main(){
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];
f.close();
back(1);
g<<t;
g.close();
}