Pagini recente » Cod sursa (job #2272343) | Cod sursa (job #1528393) | Cod sursa (job #636713) | Cod sursa (job #87589) | Cod sursa (job #1245840)
#include<fstream>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int n,m,i,j,c,st,s,maxim;
int a[1001][1001],v[1000001];
int main(){
fin>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
fin>>a[i][j];
while(v[m+1]==0){
c=1;
while(v[c]==1){
v[c]=0;
c++;
}
v[c]=1;
st=0;
for(i=1;i<=n;i++){
s=0;
for(j=1;j<=m;j++){
if(v[j]==1)
s+=a[i][j];
else
s-=a[i][j];
}
if(s<0)
s*=(-1);
st+=s;
}
if(maxim<st)
maxim=st;
}
fout<<maxim;
return 0;
}