Pagini recente » Cod sursa (job #1240355) | Cod sursa (job #855564) | Cod sursa (job #3273480) | Cod sursa (job #3326291) | Cod sursa (job #3313276)
#include <fstream>
ifstream cin ("flip.in");
ofstream cout ("flip.out");
using namespace std;
int a[17][17], st[40], n,m, smax;
void bkt(int k)
{
if(n+m+1==k)
{
int s=0;
for(int i=1;i<=n;i++)
for(int j=n+1;j<=n+m;j++)
{
if((st[i]+st[j])%2==1) s=s-a[i][j-n];
else s=s+a[i][j-n];
}
if(s>smax) smax=s;
}
else
{
st[k]=0;
bkt(k+1);
st[k]=1;
bkt(k+1);
}
}
int main()
{
int i,j;
cin>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
cin>>a[i][j];
smax+=a[i][j];
}
bkt(1);
cout<<smax;
return 0;
}