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

#include<iostream>#include<cmath>using namespace std;int fenshu(int x[21][21],int u,int v,int s1,int s2){int sum=0;if(u-1>=0){if(x[u-1][v]*x[u][v]>0)sum=sum-abs(x[u-1][v]);elsesum=sum+abs(x[u-1][v]);} if(u+1<s1){if(x[u+1][v]*x[u][v]>0)sum=sum-abs(x[u+1][v]);elsesum=sum+abs(x[u+1][v]);} if(v-1>=0){if(x[u][v-1]*x[u][v]>0)sum=sum-abs(x[u][v-1]);elsesum=sum+abs(x[u][v-1]);} if(v+1<s2){if(x[u][v+1]*x[u][v]>0)sum=sum-abs(x[u][v+1]);elsesum=sum+abs(x[u][v+1]);} return sum;}int main(){int n,m;int a[21][21];int b[21][21];while(cin>>m>>n){if(m==0&&n==0)break;int i,j,max=0,x=0,y=0;for(i=0;i<m;i++){for(j=0;j<n;j++){cin>>a[i][j];}}for(i=0;i<m;i++){for(j=0;j<n;j++){b[i][j]=fenshu(a,i,j,m,n);if(b[i][j]>max){max=b[i][j];x=i;y=j;}}}cout<<x+1<<" "<<y+1<<" "<<max<<endl;} return 0;}