Pagini recente » Cod sursa (job #2399174) | Cod sursa (job #2789642) | Cod sursa (job #1803298) | Cod sursa (job #1012386) | Cod sursa (job #1111707)
#include <fstream>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int a[17][17],v[17],i,j,x,n,m;
long long maxim,ss,s;
int main(){
fin>>n>>m;
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
fin>>a[i][j];
maxim+=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++){
ss=0;
for(x=1;x<=m;x++){
if(v[x]==1){
ss-=a[i][x];
}
else{
ss+=a[i][x];
}
}
if(ss<0){
ss*=(-1);
}
s+=ss;
}
if(s>maxim){
maxim=s;
}
}
fout<<maxim<<"\n";
return 0;
}