Pagini recente » Cod sursa (job #288844) | Cod sursa (job #2211838) | Cod sursa (job #2261352) | Cod sursa (job #2801156) | Cod sursa (job #282441)
Cod sursa(job #282441)
#include<fstream.h>
#define M 16
#define N 16
#define MAX -2000000
long a[N][M],max=MAX;
int n,m,s;
ofstream out("flip.out");
ifstream in("flip.in");
void init()
{
int i,j;
in>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
in>>a[i][j];
}
void rezolv()
{
int i,j;
int c1[M],c2[N];
for(j=1;j<=m;j++)
for(i=1;i<=n;i++)
if(a[i][j]<=0)
c1[j]++;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
if(a[i][j]<=0)
c2[i]++;
int maxl=c2[1],maxc=c1[1],i1,j1;
for(i=2,j=2;i<=n,j<=m;i++,j++)
if(c2[i]>maxl && c1[j]>maxc)
{
i1=i;j1=j;
}
for(j=1,i=1;j<=m,i<=n;j++,i++)
{
a[i1][j]=a[i1][j]*(-1);
a[i][j1]=a[i][j1]*(-1);
}
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
s+=a[i][j];
out<<s;
}
int main()
{
init();
rezolv();
return 0;
}