Pagini recente » Cod sursa (job #885757) | Cod sursa (job #1059094) | Cod sursa (job #6853) | Cod sursa (job #1855323) | Cod sursa (job #2255583)
#include <fstream>
#include <cstring>
#include <algorithm>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int i,j,x,y,n,m,a[17][17],sub[17],v[17],maxi,S;
int main()
{ f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
for(i=0;i<=(1<<m)-1;i++){
for(x=1;x<=n;x++)
sub[x]=1;
for(j=0;j<m;j++){
if(((i>>j)&1)==1){
sub[j+1]=-1;
}
}
S=0;
for(x=1;x<=n;x++){
v[x]=0;
for(y=1;y<=m;y++)
v[x]+=a[x][y]*sub[y];
if(v[x]<0)
v[x]*=-1;
S+=v[x];
}
if(maxi<S)
maxi=S;
}
g<<maxi;
return 0;
}