Pagini recente » Cod sursa (job #1584574) | Cod sursa (job #3189025) | Cod sursa (job #3166743) | Cod sursa (job #146539) | Cod sursa (job #3250184)
#include <bits/stdc++.h>
using namespace std;
ifstream fi("flip.in");
ofstream fo("flip.out");
long long int n,m,mat[17][17],suma,maxx;
int main()
{
fi>>n>>m;
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j)
fi>>mat[i][j];
suma=0;
for(int k=1;k<=n;++k){
for(int q=1;q<=k;++q){
suma=0;
for(int i=1;i<=n;++i){
for(int j=1;j<=m;++j){
if(i==k&&j!=q)suma=suma+(-1)*mat[i][j];
else{
if(i!=k&&j==q)suma=suma+(-1)*mat[i][j];
else suma=suma+mat[i][j];
}
}
}
if(suma>maxx){
maxx=suma;
}
}
}
fo<<maxx;
fi.close();
fo.close();
return 0;
}