Pagini recente » Cod sursa (job #402938) | Cod sursa (job #1593170) | Cod sursa (job #291887) | Cod sursa (job #2040695) | Cod sursa (job #1143352)
#include <fstream>
using namespace std;
int v[20],i,j,d,n,m;
long long a[20][20],Smax,s1,s;
ifstream f("flip.in");
ofstream g("flip.out");
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
while(v[0]==0)
{
j=m;
while(v[j]==1)
{
v[j]=0;j--;
}
v[j]=1;s=0;
for(i=1;i<=n;i++)
{s1=0;
for(d=1;d<=m;d++)
{
if(v[d]==1)
s1-=a[i][d];
else
s1+=a[i][d];
}
if(s1<0) s1*=(-1);
s+=s1;
}
if(s>Smax) Smax=s;
}
g<<Smax;
f.close();
g.close();
return 0;
}