Pagini recente » Cod sursa (job #2946108) | Cod sursa (job #2118272) | Cod sursa (job #2929987) | Cod sursa (job #674817) | Cod sursa (job #2876881)
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int sol,a[20][20],n,m;
bool v[20];
void back(int k)
{
if(k>n)
{
int sum=0;
for(int j=1;j<=m;j++)
{
int sus=0;
for(int i=1;i<=n;i++)
if(v[i]==0)
sus=sus+a[i][j];
else
sus=sus-a[i][j];
sum=sum+max(sus,-sus);
}
sol=max(sol,sum);
return;
}
v[k]=1;
back(k+1);
v[k]=0;
back(k+1);
}
int i,j,x;
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
f>>a[i][j];
sol=sol+a[i][j];
}
}
back(1);
g<<sol;
return 0;
}