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

#include<iostream>#include<stdio.h>#include<cmath>using namespace std;int a[25][25], b[25][25];int main(){int n, m;while(scanf("%d%d", &n, &m) != EOF && (n&&m)){memset(a, 0, sizeof(a));int i, j, Max = -1, Maxi = 0, Maxj = 0;for( i=1; i <= n; i++ ){for( j=1; j <= m; j++ )scanf("%d", &a[i][j]);}for( i=1; i <= n; i++ ){for( j=1; j <= m; j++ ){b[i][j] = a[i-1][j] + a[i+1][j] + a[i][j-1] + a[i][j+1];if(a[i][j] > 0 && b[i][j] > 0 || a[i][j] < 0 && b[i][j] < 0)b[i][j] = -1 * abs(b[i][j]);elseb[i][j] = abs(b[i][j]);if(Max < b[i][j])Max = b[i][j], Maxi = i, Maxj = j;}}printf("%d %d %d\n", Maxi, Maxj, Max);}return 0;}