Pagini recente » Cod sursa (job #1039387) | Cod sursa (job #2380556) | Cod sursa (job #1158706) | Cod sursa (job #2119315) | Cod sursa (job #1110096)
#include<fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int a[20][20], v[50];
int n, m, sol, i, j;
void back(int k);
void solve(int k);
int main() {
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
back(1);
g<<sol<<"\n";
f.close();g.close();
return 0;
}
void solve(int k) {
int i,s=0,j;
for(j=1;j <= m;j ++) {
int l=0;
for(i=1;i<=n;i++)
l=l+v[i]*a[i][j];
if(l<0)
l=-l;
s+=l;
}
if(s>sol)
sol=s;
}
void back(int k) {
for(int i=-1;i<=1;i+=2) {
v[k]=i;
if(k==n)
solve(k);
else
back(k+1);
}
}