Cod sursa(job #3201526)
Utilizator | Ivanus Victor Gabriel Anleglift | Data | 8 februarie 2024 22:25:02 |
---|---|---|---|
Problema | Jocul Flip | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.72 kb |
#include <fstream>
using namespace std;
ifstream fin ("flip.in");
ofstream fout("flip.out");
int i,j,n,m,k,S,s,maxim,a[17][17],F[17];
int main()
{
fin>>n>>m;
for(i=1; i<=n; i++)
for(j=1; j<=m; j++)
fin>>a[i][j];
while(F[1]==0)
{
k=m;
while(F[k]!=0)
F[k--]=0;
F[k]=1;
S=0;
for(i=1; i<=n; i++)
{
s=0;
for(j=1; j<=m; j++)
if(F[j]!=0)
s-=a[i][j];
else
s+=a[i][j];
if(s<0)
s*=-1;
S+=s;
}
if(S>maxim)
maxim=S;
}
fout<<maxim;
return 0;
}