Pagini recente » Cod sursa (job #2710096) | Cod sursa (job #2226113) | Cod sursa (job #759706) | Cod sursa (job #1082965) | Cod sursa (job #1643172)
#include <fstream>
using namespace std;
int n, m, i, j;
long long a[20][20], s[20], S, smax, s1;
bool v[20];
int main()
{
ifstream f("flip.in");
ofstream g("flip.out");
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
while(!v[0])
{
j=m;
while(v[j])
{
v[j]=0;
j--;
}
v[j]=1;
s1=0;
for(i=1;i<=n;i++)
{
S=0;
for(j=1;j<=m;j++)
if(v[j])
S-=a[i][j];
else S+=a[i][j];
if(S<0)
S=(-1)*S;
s1+=S;
}
if(s1>smax)
smax=s1;
}
g<<smax;
return 0;
}