Pagini recente » Cod sursa (job #283094) | Cod sursa (job #149813) | Cod sursa (job #2949269) | Cod sursa (job #862679) | Cod sursa (job #1585553)
#include <fstream>
using namespace std;
int n, m, i, ok, j, s, st, a[20][20], maxim=-1, b[20];
int main()
{
ifstream fin("flip.in");
ofstream fout("flip.out");
fin>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
fin>>a[i][j];
ok=1;
while(ok==1){
ok=0;
for(i=1;i<=n;i++){
if(b[i]==0){
ok=1;
b[i]=1;
break;
}
else
b[i]=0;
}
if(ok==1){
st=0;
for(j=1;j<=m;j++){
s=0;
for(i=1;i<=n;i++){
if(b[i]==1)
s+=a[i][j]*(-1);
else
s+=a[i][j];
}
if(s<0)
st+=-s;
else
st+=s;
}
if(st>maxim)
maxim=st;
}
}
fout<<maxim;
return 0;
}