Pagini recente » Cod sursa (job #2296072) | Cod sursa (job #2225527) | Cod sursa (job #1045538) | Cod sursa (job #1287747) | Cod sursa (job #1935495)
#include <bits/stdc++.h>
using namespace std;
int n,m,a[17][17],linie[17],ans=INT_MIN;
ifstream f("flip.in");
ofstream g("flip.out");
void calc(){
int sumtot=0;
for(int j=1;j<=m;j++){
int sum=0;
for(int i=1;i<=n;i++){
sum+=a[i][j]*linie[i];
}
sumtot+=max(sum,sum*-1);
}
if(sumtot>ans)ans=sumtot;
}
void bktr(int pos){
if(pos==n+1)calc();
else{
linie[pos]=1;
bktr(pos+1);
linie[pos]=-1;
bktr(pos+1);
}
}
int main()
{
f>>n>>m;
for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)f>>a[i][j];
bktr(1);
g<<ans;
return 0;
}