Pagini recente » Cod sursa (job #2345374) | Cod sursa (job #2807759) | Cod sursa (job #2176313) | Cod sursa (job #1330764) | Cod sursa (job #412857)
Cod sursa(job #412857)
#include<fstream>
using namespace std;
int main()
{
int i,j,k,sl1,sl2,smax,s,ok=1,n,m,a[20][20],b[20][20],v[20];
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];
k=1;
v[1]=-3;
while(k)if(v[k]<1){
v[k]=v[k]+2;
if(k==m){
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)b[i][j]=a[i][j]*v[j];
for(i=1;i<=n;i++)
{
sl1=0;
sl2=0;
for(j=1;j<=m;j++){
sl1=sl1+b[i][j];
sl2=sl2-b[i][j];
}
if(sl2>sl1)for(j=1;j<=m;j++)b[i][j]=b[i][j]*(-1);
}
s=0;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)s=s+b[i][j];
if(ok){
smax=s;
ok=0;
}
else if(s>smax)smax=s;
}
else {
k++;
v[k]=-3;
}
}
else k--;
fout<<smax;
return 0;
}