Pagini recente » Cod sursa (job #2852098) | Cod sursa (job #1826882) | Cod sursa (job #1965066) | Cod sursa (job #644924) | Cod sursa (job #1164932)
#include <fstream>
#include <vector>
#include <algorithm>
#include <cstring>
#define Nmax 50
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int n,m,a[Nmax][Nmax],st[Nmax];
long long sol;
void Back(int k)
{
if(k==m+n+1)
{
long long sum=0;
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j)
sum=sum+a[i][j]*st[i]*st[n+j];
if(sum>sol)sol=sum;
return;
}
st[k]=-1;
Back(k+1);
st[k]=1;
Back(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];
Back(1);
g<<sol<<'\n';
f.close();g.close();
return 0;
}