Pagini recente » Cod sursa (job #2528157) | Cod sursa (job #762148) | Cod sursa (job #2928313) | Cod sursa (job #130481) | Cod sursa (job #643183)
Cod sursa(job #643183)
#include<cstdio>
int n,m,i,j,k,t[17],e,a[17][17],l[17],c[17],d[17],p,s;
int main()
{freopen("flip.in","r",stdin);
freopen("flip.out","w",stdout);
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
scanf("%d",&a[i][j]),l[i]+=a[i][j],c[j]+=a[i][j];
for(i=1;i<=n;i++)
{k=1,t[k]=0;
while(k)
{t[k]++;
if(t[k]<=n)
if(k==i)
{s=0;
for(j=1;j<=m;j++)
{d[j]=c[j];
for(e=1;e<=i;e++)
d[j]=d[j]-2*a[t[e]][j];
if(d[j]<0)
d[j]=-d[j];
s+=d[j];}
if(s>p)
p=s;}
else
k++,t[k]=t[k-1];
else
k--;}}
printf("%d",p);
return 0;}