HDOJ 4500 http://acm.hdu.edu.cn/showproblem.php?pid=4500
水题一道:
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
int data[25][25];
struct node{
int num,row,col;
} ;
bool cmp(node a,node b)
{
if(a.num!=b.num)return a.num>b.num;
else if(a.row!=b.row)return a.row<b.row;
else return a.col<b.col;
}
int main()
{
int n,m;
vector<node> re;
while(cin>>n>>m)
{
if(n+m==0)break;
for(int i=0;i<n;i++)
for(int j=0;j<m;j++)
{
cin>>data[i][j];
}
for(int i=0;i<n;i++)
for(int j=0;j<m;j++)
{
node tmp;
tmp.num=0;
tmp.row=i;
tmp.col=j;
if(i-1>=0){
if(data[i][j]*data[i-1][j]<0)
tmp.num+=abs(data[i-1][j]);
else tmp.num-=abs(data[i-1][j]);
}
if(i+1<n){
if(data[i][j]*data[i+1][j]<0)
tmp.num+=abs(data[i+1][j]);
else tmp.num-=abs(data[i+1][j]);
}
if(j-1>=0){
if(data[i][j]*data[i][j-1]<0)
tmp.num+=abs(data[i][j-1]);
else tmp.num-=abs(data[i][j-1]);
}
if(j+1<m){
if(data[i][j]*data[i][j+1]<0)
tmp.num+=abs(data[i][j+1]);
else tmp.num-=abs(data[i][j+1]);
}
re.push_back(tmp);
}
sort(re.begin(),re.end(),cmp);
cout<<re[0].row+1<<" "<<re[0].col+1<<" "<<re[0].num<<endl;
re.clear();
}
return 0;
}