摘要：
/*建图用的邻接表，复杂度O(E*logE)*/struct pnode { int num; int len; pnode() {} pnode(int a, int b) : num(a), len(b) {} bool operator < (const pnode tmp) const { return len > tmp.len; }};int dis[N];bool vis[N];int n;void bfs(int s) { priority_queue<pnode> q; q.push(pnode(s, 0)); ... 阅读全文