Pagini recente » Cod sursa (job #2971026) | Cod sursa (job #2398267) | Cod sursa (job #2850289) | Cod sursa (job #899057) | Cod sursa (job #1118790)
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int a[17][17],v[17],i,j,x,n,m;
long long maxim,ss,s;
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
f>>a[i][j];
maxim=maxim+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++)
{
ss=0;
for(x=1;x<=m;x++)
{
if(v[x]==1)
{
ss-=a[i][x];
}
else
{
ss+=a[i][x];
}
}
if(ss<0)
{
ss*=(-1);
}
s=s+ss;
}
if(s>maxim)
{
maxim=s;
}
}
g<<maxim<<"\n";
return 0;
}