Cod sursa(job #406998)
Utilizator | Jerdea Florin ursu-vali | Data | 1 martie 2010 22:55:09 |
---|---|---|---|
Problema | Jocul Flip | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 1.13 kb |
#include<fstream>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int main()
{
long a[17][17],k,s,smax,smin;
int n,m,i,j;
fin>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
fin>>a[i][j];
while(1)
{
k=0;
s=0;
smin=0;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
s=s+a[i][j];
if((s<0)&&(s<smin))
{
k=i;
smin=s;
}
}
s=0;
for(i=1;i<=m;i++)
{
for(j=1;j<=n;j++)
s=s+a[j][i];
if((s<0)&&(s<smin))
{
k=-i;
smin=s;
}
}
if(k=0)
break;
else
if(k<0)
for(i=1;i<=n;i++)
a[i][-k]=-a[i][-k];
else
for(i=1;i<=m;i++)
a[k][i]=-a[k][i];
}
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
smax=smax+a[i][j];
fout<<smax;
fin.close();
fout.close();
return 0;
}