Pagini recente » Istoria paginii runda/cercel_e_gay_runda_2 | Cod sursa (job #1219250) | Cod sursa (job #1692408) | Cod sursa (job #440420) | Cod sursa (job #2630695)
#include <bits/stdc++.h>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int n,m,a[20][20],i,j,s,v[20],sf,maxs,k;
void bkt(int k)
{if(k==m+1)
{ int i,j,s =0,sf = 0;
for(i = 1; i <= n; i++){
s = 0;
for(j = 1; j <= m; j++){
s += a[i][j]*v[j];
}
if(s < 0){
s = -s;
}
sf += s;
}
maxs = max(maxs,sf);
}
else
{
v[k] = 1;
bkt(k+1);
v[k] = -1;
bkt(k+1);
}}
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
bkt(1);
g<<maxs;
return 0;}