Cod sursa(job #1115539)
| Utilizator | Data | 21 februarie 2014 21:30:46 | |
|---|---|---|---|
| Problema | Jocul Flip | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.88 kb |
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int a[17][17],v[17],i,j,x,n,m;
long long maxim,ss,s;
int main(){
f>>n>>m;
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
f
>>a[i][j];
maxim+=a[i][j];
}
}
while(v[0]==0){
j=m;
while(v[j]==1){
v[j]=0;
j--;
}
v[j]=1;
s=0;
for(i=1;i<=n;i++){
ss=0;
for(x=1;x<=m;x++){
if(v[x]==1){
ss-=a[i][x];
}
else{
ss+=a[i][x];
}
}
if(ss<0){
ss*=(-1);
}
s+=ss;
}
if(s>maxim){
maxim=s;
}
}
g<<maxim<<"\n";
return 0;
}
