Cod sursa(job #3201209)
Utilizator | Cismaru Theodor-Alexe Theo20067 | Data | 7 februarie 2024 09:47:31 |
---|---|---|---|
Problema | Jocul Flip | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.7 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fin ("flip.in");
ofstream fout("flip.out");
int C,i,n,k,m,F[17],S,j,s,maxim,a[17][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])
{
k=m;
while(F[k])
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])
s-=a[i][j];
else
s+=a[i][j];
s=max(s,-s);
S+=s;
}
maxim=max(S,maxim);
}
fout<<maxim;
return 0;
}