Pagini recente » Cod sursa (job #2783051) | Cod sursa (job #2739366) | Cod sursa (job #1420801) | Cod sursa (job #2989803) | Cod sursa (job #1426104)
#include <iostream>
#include <fstream>
using namespace std;
int a[100][100],s[100],m ,k, n,mare,best;
void calcul()
{
ofstream g("filip.out");
int sum=0,nr=0;
for(int i = 0 ; i<n ; i++)
{
{
for(int j = 0 ; j < m ; j++)
{
nr =nr+a[i][j]*s[j];
}
sum=sum + max(nr,-nr);
}
best=max(sum,best);
}
g<<best;
}
void bkt(int k)
{
if(k == m)
{
calcul();
return;
}
s[k]=1;
bkt(k+1);
s[k]=-1;
bkt(k+1);
}
int main ()
{
ifstream f("filip.in");
bkt(1);
f>>m>>n;
for ( int i= 0 ; i < n ; i++ )
{
for(int j= 0 ; j <m ; j++)
f>>a[i][j];
}
return 0 ;
}