Pagini recente » Cod sursa (job #2821155) | Cod sursa (job #588675) | Cod sursa (job #3274427) | Cod sursa (job #2318138) | Cod sursa (job #907645)
Cod sursa(job #907645)
#include<iostream>
#include<fstream>
short N,M;
long a[100][100],S=0;
using namespace std;
void suma(){
S=0;
for(int i=1;i<=N;i++){
for(int j=1;j<=M;j++){
S+=a[i][j];
}
}
}
void comutator(int x,int i){
if(x==1){
for(int j=1;j<=M;j++){
a[i][j]*=-1;
}
}else{
for(int j=1;j<=N;j++){
a[j][i]*=-1;
}
}
}
int main()
{long Smax;
ifstream f("flip.in");
f>>N;
f>>M;
for(int i=1;i<=N;i++){
for(int j=1;j<=M;j++){
f>>a[i][j];
}
}
f.close();
suma();
Smax=S;
for(int i=1;i<=N;i++){
comutator(1,i);
suma();
if(Smax<S)
Smax=S;
else
comutator(1,i);
for(int j=1;j<=M;j++){
comutator(2,j);
suma();
if(Smax<S)
Smax=S;
else
comutator(2,j);
}
}
ofstream f2("flip.in");
f2<<Smax;
f2.close();
}