Abbott 的复仇（Abbott's Revenge，ACM|IPPC World Finals 2000, UVa 816)
//算法竞赛入门经典中一道经典的用BFS求最短路径例题//2015/01/30#include#include#include#include#includeusing namespace std;typedef struct node //结点数据 { node(){} node(int row,int col,int d):r(row),c(col),dir(d){}
