Cod sursa(job #1906983)
Utilizator | Data | 6 martie 2017 17:16:57 | |
---|---|---|---|
Problema | Jocul Flip | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
const int N = 16;
int n, m, a[N][N], oriz[N], vert[N], total;
int main()
{
fin>>n>>m;
for(int i=0;i<n;++i)
for(int j=0;j<m;++j)
fin>>a[i][j], oriz[i]+=a[i][j], vert[j]+=a[i][j], total+=a[i][j];
int sol=total;
for(int i=0;i<n;++i)
for(int j=0;j<m;++j)
sol=max(sol, total-2*vert[j]-2*oriz[i]+4*a[i][j]);
fout<<sol;
return 0;
}