Pagini recente » Cod sursa (job #1398894) | Cod sursa (job #393250) | Cod sursa (job #537734) | Cod sursa (job #2826421) | Cod sursa (job #2399533)
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int n,m,a[20][20],sol[20],maxim;
void verificare()
{ int ans=0,sum;
for(int j=1;j<=m;j++)
{
sum=0;
for(int i=1;i<=n;i++)
sum+=sol[i]*a[i][j];
sum=abs(sum);
ans+=sum;
}
maxim=max(maxim,ans);
}
void backk(int k)
{
if(k==n+1)verificare();
else if(k<=n)
{
sol[k]=1;
backk(k+1);
sol[k]=-1;
backk(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];
backk(1);
g<<maxim<<'\n';
return 0;
}