Pagini recente » Cod sursa (job #3204700) | Cod sursa (job #571277) | Cod sursa (job #324656) | Cod sursa (job #2944375) | Cod sursa (job #1184229)
#include <fstream>
#include <math.h>
#include <iostream>
using namespace std;
ifstream f;
ofstream g;
int m, n, maxi=0;
int t[16][16];
int x[20];
int main(){
f.open("flip.in");
g.open("flip.out");
int i, j, ok=0, s, s1;
f>>m>>n;
for(i=0; i<m; i++)
for(j=0; j<n; j++)
f>>t[i][j];
while(!ok){
s=0;
for(i=0; i<m; i++){
s1=0;
for(j=0; j<n; j++)
if(x[j]>0) s1-=t[i][j];
else s1+=t[i][j];
if(s1<0) s1=-s1;
s+=s1;}
if(s>maxi) maxi=s;
for(i=n-1; i>=0 && x[i]>0; i--) x[i]=0;
if(i>=0) x[i]=1;
else ok=1;}
g<<maxi<<'\n';
return 0;
}