搜索：Codeforces Beta Round （BFS）
【转】http://blog.csdn.net/zxy_snow/article/details/5952710
?
#include <stdio.h>#include <stdlib.h>#include <iostream>#include <memory.h>#include <queue>using namespace std;int map[2002][2002];queue<int> q;int main(void){freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);int n,m,fi,fj;int num,x,y,a,b;int dir[8] = {0,1,0,-1,1,0,-1,0};cin >> n >> m >> num;memset(map,0,sizeof(map));for(int i=1; i<=num; i++){cin >> x >> y;q.push(x);q.push(y);map[x][y] = 1;}while( !q.empty() ){a = q.front();q.pop();b = q.front();q.pop();for(int i=0; i<8; i+=2){aa = a+dir[i];bb = b+dir[i+1];if( map[aa][bb] == 0 && aa <= n && aa >=1 && bb<=m && bb >=1){map[aa][bb] = 1;q.push(aa);q.push(bb);}}}cout << a << ' ' << b << endl; return 0;}?