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

 1 #include<iostream>
 2 #include<algorithm>
 3 #include<cstdio>
 4 #include<cstring>
 5 using namespace std;
 6 #define INF 0x3f3f3f3f;
 7 const int maxn = 25;
 8 int a[maxn][maxn],b[maxn][maxn];
 9 
10 int main(){
11     int n,m;
12     while(~scanf("%d%d",&n,&m)&&n&&m){
13         memset(a,0,sizeof(a));
14         memset(b,0,sizeof(b));
15         for( int i=1; i<=n; i++ ){
16             for( int j=1; j<=m; j++ ){
17                 cin>>a[i][j];
18             }
19         }
20         int tmp=-1*INF;
21         for( int i=1; i<=n; i++ ){
22             for( int j=1; j<=m; j++ ){
23                 if(a[i][j]<0){
24                      b[i][j] = a[i-1][j] + a[i][j-1] + a[i][j+1] + a[i+1][j];
25                 }
26                 else{
27                      b[i][j] = -(a[i-1][j] + a[i][j-1] + a[i][j+1] + a[i+1][j]);
28                 }
29                 tmp=max(tmp,b[i][j]);
30             }
31         }
32         int row=0,col=0;
33         int flag=0;
34         for( int i=1; i<=n; i++ ){
35             for( int j=1; j<=m; j++ ){
36                 if(b[i][j]==tmp){
37                     row=i;
38                     col=j;
39                     flag=1;
40                     break;
41                 }
42             }
43             if(flag) break;
44         }
45         printf("%d %d %d\n",row,col,tmp );
46     }
47     return 0;
48 }