Pagini recente » Cod sursa (job #902447) | Cod sursa (job #2334324) | Cod sursa (job #871071) | Cod sursa (job #2667820) | Cod sursa (job #1470572)
#include<stdio.h>
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++)
for(k=1,t[k]=0;k;) {
t[k]++;
if(t[k]<=n)
if(k==i) {
for(s=0,j=1;j<=m;j++) {
for(d[j]=c[j],e=1;e<=i;e++)
d[j]=d[j]-2*a[t[e]][j];
d[j]=d[j]<0?-d[j]:d[j],s+=d[j];
}
p=s>p?s:p;
}
else
k++,t[k]=t[k-1];
else
k--;
}
printf("%d",p);
}