Pagini recente » Cod sursa (job #958846) | Cod sursa (job #2074592) | Cod sursa (job #303569) | Cod sursa (job #644743) | Cod sursa (job #1730812)
#include <iostream>
#include <fstream>
#define NMAX 20
using namespace std;
int a[NMAX][NMAX],m;
int s[NMAX],n,maxsum=0;
ifstream f("flip.in");
ofstream g("flip.out");
void sum(){
int sum=0;
int partsum;
for(int j=1;j<=n;j++){
partsum=0;
for(int i=1;i<=m;i++)
partsum=a[i][j]*s[i];
sum+=abs(partsum);
}
maxsum=max(maxsum,sum);
}
void bk(int k){
for(int i=-1;i<2;i+=2){
s[k]=i;
if(k>=n)
sum();
else bk(k+1);
}
}
int main()
{
f >> n >> m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++){
f >> a[i][j];
maxsum+=a[i][j];
}
bk(1);
g << maxsum;
f.close();
g.close();
return 0;
}