Pagini recente » Autentificare | Istoria paginii runda/pregatireoji-lensumin120pct/clasament | Cod sursa (job #1901076) | Istoria paginii runda/icrisop_color4 | Cod sursa (job #295544)
Cod sursa(job #295544)
#include<fstream>
using namespace std;
int v[20][20],s[20],n,m,i,j,k;
long long sum,S,sol=-(1<<30);
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>>v[i][j];
k=1; s[1]=3;
while(k>0)
if(s[k]>-1)
{ s[k]-=2;
if(k==n)
{ S=0;
for(i=1;i<=n;i++)
{sum=0;
for(j=1;j<=m;j++)
if(s[j]==-1) sum+=v[i][j]*(-1);
else sum+=v[i][j];
if(sum<0) sum*=(-1);
S+=sum;
}
if(S>sol) sol=S;
}
else {k++; s[k]=3;}
}
else k--;
g<<sol;
f.close();
g.close();
return 0;
}