4500 小Q系列故事——屌丝的逆袭

#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>

#define MAX 20 + 3

using namespace std;

const int dx[] = {-1,1,0,0};
const int dy[] = {0,0,-1,1};

int main(){
    int n,m;
    while( cin>>n>>m && n && m ){
        int pos[MAX][MAX] = {0};
        for(int i = 1; i <= n; i ++ )
            for(int j = 1; j <= m ; j ++ )
                cin>>pos[i][j];

        int value[MAX][MAX] = {0};
        for(int i = 1; i <=n ; i ++ ){
            for(int j = 1; j <=m; j ++){
                for(int k = 0; k < 4; k ++ ){
                    if(pos[ i+dx[k] ][ j+dy[k] ]*pos[i][j] < 0) value[i][j] += abs(pos[ i+dx[k] ][ j+dy[k] ]);
                    else value[i][j] -= abs(pos[ i+dx[k] ][ j+dy[k] ]);
                }
            }
        }

        int maxV = -1<<30, idx,idy;
        for(int i = 1; i <= n; i ++ ){
            for(int j = 1; j <= m ; j ++ ){
                if(maxV < value[i][j]){
                    maxV = value[i][j];
                    idx = i;
                    idy = j;
                }
            }
        }
        cout<<idx << " "<<idy<<" "<<maxV<<endl;
    }

    return 0;
}