Pagini recente » Cod sursa (job #114282) | Cod sursa (job #20660) | Cod sursa (job #1059365) | Cod sursa (job #2819112) | Cod sursa (job #3162864)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("flip.in");
ofstream cout("flip.out");
int v[100][100], a[100], n, m, s, smax, t,k;
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
cin>>v[i][j];
}
while(a[0]==0)
{
s=0;
k=m;
while(a[k]==1)
{
a[k]=0;
k--;
}
a[k]=1;
for(int i=1;i<=n;i++)
{
t=0;
for(int j=1;j<=m;j++)
{
if(a[j]==1)
{
t+=v[i][j]*-1;
}
else
t+=v[i][j];
}
if(t<0)
s+=t*-1;
else
s+=t;
}
if(s>smax)
smax=s;
}
cout<<smax;
}