Pagini recente » Cod sursa (job #2347838) | Cod sursa (job #2237752) | Cod sursa (job #2105671) | Cod sursa (job #1273091) | Cod sursa (job #363679)
Cod sursa(job #363679)
#include<iostream>
#include<fstream.h>
ifstream f("flip.in");
ofstream g("flip.out");
int i,j,m,n,p=1,l=0,k=0,o;
int a[100][100],b[100][100],sc[100],sl[100];
int d[100],c[100],s=0;
int max=-1000000;
int suma=0;
int main(){
f>>n>>m;
for(i=0;i<n;i++)
for(j=0;j<m;j++)
{f>>a[i][j];
b[i][j]=a[i][j];
suma=suma+a[i][j];}
for(i=0;i<n;i++)
{ while(k<m)
{sl[i]=sl[i]+a[i][k];
k++;}
k=0;}
for(i=0;i<m;i++)
{ while(l<n){
sc[i]=sc[i]+a[l][i];
l++;}
l=0;}
for(i=0;i<n;i++)
{ while(s<m)
{c[i]=c[i]+a[i][s]*(-1);
s++;
}
s=0;}
for(i=0;i<m;i++)
{while(j<n){
d[i]=d[i]+a[j][i]*(-1);
j++;}
j=0;}
for(i=0;i<n;i++)
for(o=0;o<m;o++)
if(suma+c[i]+d[o]-sl[i]-sc[o]>max)
max=suma+c[i]+d[o]-sl[i]-sc[o];
g<<max;}