Pagini recente » Cod sursa (job #1681159) | Cod sursa (job #1340229) | Cod sursa (job #1459936) | Cod sursa (job #674931) | Cod sursa (job #1150037)
#include <iostream>
#include <fstream>
using namespace std;
int v[17],i,j,q,n,m;
long long maxx,s2,s;
int main()
{
ifstream f("flip.in");
ofstream g("flip.out");
f>>n>>m;
int a[n+1][m+1];
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
f>>a[i][j];
maxx=maxx+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++)
{
s2=0;
for(q=1;q<=m;q++)
{
if(v[q]==1)
{
s2-=a[i][q];
}
else
{
s2+=a[i][q];
}
}
if(s2<0)
{
s2*=(-1);
}
s=s+s2;
}
if(s>maxx)
{
maxx=s;
}
}
g<<maxx<<"\n";
return 0;
}