Cod sursa(job #1300887)
| Utilizator | Data | 25 decembrie 2014 01:42:29 | |
|---|---|---|---|
| Problema | Jocul Flip | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Teme Pregatire ACM Unibuc 2014, Anul II | Marime | 0.64 kb |
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
long n,m,a[20][20],v[20],i,j;
long long x,S,smax;
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
f.close();
while(!v[0])
{
j=m;
while(v[j])
{
v[j]=0;
j--;
}
v[j]=1;S=0;
for(i=1;i<=n;i++)
{x=0;
for(j=1;j<=m;j++)
if(v[j]) x-=a[i][j];
else x+=a[i][j];
if(x<0) x*=(-1);
S+=x;}
if(S>smax) smax=S;
}
g<<smax;g.close();
return 0;
}
