CCF201512-2 消除类游戏

#include <iostream>
using namespace std;

const int N = 31;
int a[N][N];


int f(int a){

return a > 0 ? -a:a;

}
int main(){

   int n,m,i,j,k,tmp;
    int f(int);
   cin >> n >> m;
   for(i = 0;i < n;i++)
    for(j = 0;j < m;j++)
    cin >> a[i][j];


   for(i = 0;i < n ;i++)
    for(j = 0;j < m - 2;j++)
        if(f(a[i][j]) == f(a[i][j+1]) && f(a[i][j+1]) == f(a[i][j+2])){
            a[i][j] = f(a[i][j+1]);
            a[i][j+1] = f(a[i][j+1]);
            a[i][j+2] = f(a[i][j+1]);
    }

   for(i = 0;i < m ;i++)
    for(j = 0;j < n - 2;j++)
    if(f(a[j][i]) ==f(a[j+1][i]) && f(a[j][i]) == f(a[j+2][i])){

        a[j][i] = f(a[j][i]);
        a[j+1][i] = f(a[j][i]);
        a[j+2][i] = f(a[j][i]);

    }



   for(i = 0;i < n;i++){
    for(j = 0;j < m;j++){
            if(a[i][j] < 0 )
                a[i][j] = 0;
        cout << a[i][j] << " " ;
    }
    cout << endl;
   }
    return 0;
}