Pagini recente » Cod sursa (job #2502771) | Cod sursa (job #1629012) | Cod sursa (job #2526061) | Cod sursa (job #751499) | Cod sursa (job #2297119)
#include <iostream>
#include <fstream>
using namespace std;
int main(){
ifstream f("flip.in");
ofstream g("flip.out");
int n,m,s=0,max=0,q=0;
f>>n;
f>>m;
int a[n][m];
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++){
f>>a[i][j];
if(a[i][j]<0)
q++;
s=s+a[i][j];
}
max=max+s;
s=0;
}
if(q==0)
g<<max;
else {
for(int h=0;h<n;h++){
for(int r=0;r<m;r++)
{
s=s+(-1)*a[h][r];
}
if(s>max)
max=s;
}
g<<max;}
return 0;}