Pagini recente » Cod sursa (job #1046780) | Cod sursa (job #1787183) | Cod sursa (job #2087459) | Cod sursa (job #1428730) | Cod sursa (job #1140804)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int a[20][20],v[25],i,j,m,n, c;
int main() {
long long Smax=0,s1=0,s=0;
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++){
f>>a[i][j];
Smax=Smax+a[i][j];
}
while(v[0]==0){
j=m;
while(v[j]==1){
v[j]=0;
j--;
}
v[j]=1;
s=0;
for(i=1;i<=n;i++){
s1=0;
for(c=1;c<=m;c++){
if(v[c]==1){
s1-=a[i][c];
}
else {
s1+=a[i][c];
}
}
if(s1<0){
s1*=(-1);
}
s=s+s1;
}
if(s>Smax) {
Smax=s;
}
}
g<<Smax<<endl;
f.close();
g.close();
return 0;
}