摘要： #include <iostream>using namespace std;const int MAXN = 1010;struct MAP{int height, dist;}map[MAXN][MAXN];int hash[MAXN], dis[MAXN];int low, high, mid;int result, qq;void dijkstra(int start, int... 阅读全文