Pagini recente » Cod sursa (job #2347579) | Cod sursa (job #1867956) | Cod sursa (job #3213345) | Cod sursa (job #2174013) | Cod sursa (job #1828168)
#include <iostream>
#include <fstream>
using namespace std;
int n,m,v[20][20];
ifstream fi("flip.in");
ofstream fo("flip.out");
void Input();
int main()
{
Input();
int s,sMax=-1000050,sPart;
char a=0;
for(a=0; a <(1<<n); a++)
{
s=0;
for(int i=0; i < n; i++)
{
sPart=0;
for(int j=0; j < m; j++)
{
if(a & (1<<j))
{
sPart += v[i][m-j-1];
}
else
{
sPart+= -1 * v[i][m-j-1];
}
}
if(sPart<0)
sPart *= -1;
s+=sPart;
}
sMax = max(sMax, s);
}
fo<<sMax;
}
void Input()
{
fi>>n>>m;
for(int i=0; i<n; i++)
{
for(int j=0; j<m; j++)
fi>>v[i][j];
}
}