Pagini recente » Cod sursa (job #2940711) | Cod sursa (job #2725453) | Cod sursa (job #2627681) | Cod sursa (job #3141224) | Cod sursa (job #999011)
Cod sursa(job #999011)
#include <iostream>
#include <fstream>
using namespace std;
int n,m,v[20][20],c[20][20];
ifstream f("flip.in");
ofstream g("flip.out");
int main()
{
f>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
f>>v[i][j];
int max=0,aux=0;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
{ //copiem matricea
for(int ii=1;ii<=n;ii++)
for(int jj=1;jj<=m;jj++)
c[ii][jj]=v[ii][jj];
for(int l=1;l<=n;l++)
c[l][j]*=-1;
for(int k=1;k<=m;k++)
c[i][k]*=-1;
for(int ii=1;ii<=n;ii++)
for(int jj=1;jj<=m;jj++)
aux+=c[ii][jj];
if(max<aux) max=aux;
aux=0;
}
g<<max;
}