Pagini recente » Cod sursa (job #1873339) | Cod sursa (job #3274030) | Cod sursa (job #3261191) | corona_day4 | Cod sursa (job #2375805)
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int v[20],n,m;
int a[20][20],b[20][20];
int suml[20], sumc[20];
int maxi;
void verif(int k)
{
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++) b[i][j] = a[i][j];
int suma=0, total=0;
for(int i=1;i<=n;i++)
if(v[i])
{
for(int j=1;j<=m;j++) b[i][j]= -a[i][j];
}
for(int j=1;j<=m;j++)
{ suma=0;
for(int i=1;i<=n;i++)
suma+=b[i][j];
if(suma<0)
total-=suma;
else total+=suma;
}
if(total>maxi) maxi = total;
}
int valid(int k)
{
return 1;
}
void bk(int k)
{
for(int i=0;i<=1;i++)
{
v[k]=i;
if(valid(k))
{
if(k==n) verif(k);
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];
}
}
bk(1);
g<<maxi<<'\n';
return 0;
}