Pagini recente » Cod sursa (job #1049080) | Cod sursa (job #1044299) | Cod sursa (job #1049262) | Monitorul de evaluare | Cod sursa (job #1292680)
#include <fstream>
#include <cmath>
using namespace std;
int a[17][17], n, m;
int sMax;
int st[40];
ifstream f("flip.in");
ofstream g("flip.out");
void test()
{
int s=0,j,i,sum;
for(i=1;i<=n;i++)
{sum=0;
for(j=1;j<=m;j++)
if(st[j]==1)
sum-=a[i][j];
else
sum+=a[i][j];
if(sum<0)
s=s-sum;
else
s=s+sum;
if(s>sMax)
sMax=s;
}
}
int main()
{
f>>n>>m;
int i, j;
for(i=1; i<=n; i++)
{
for(j=1; j<=m; j++)
{ f>>a[i][j];
sMax+=a[i][j];
}
}
int r,k,x;
for(i=1;i<=pow(2,m)-1;i++)
{r=1;
for(k=1;k<=m;k++)
{x=st[k]+r;
st[k]=x%2;
r=x/2;
if(r==0)
break;
}
test();
}
g<<sMax;
return 0;
}