传送门
当然可以用队列来搞啦。
1 # include <iostream> 2 # include <cstdio> 3 # include <cstring> 4 # include <string> 5 # include <cmath> 6 # include <vector> 7 # include <map> 8 # include <queue> 9 # include <cstdlib> 10 # include <algorithm> 11 # define MAXN 1000001 12 using namespace std; 13 14 inline int get_num() 21 22 int n, k, tot, sum, h, t, ans = 1 << 30; 23 int num[MAXN]; 24 25 struct node 26 p[MAXN]; 29 30 inline bool cmp(node x, node y) 31 34 35 int main() 36 51 if(sum == k) ans = min(ans, p[t].pos p[h].pos); 52 num[p[h].a]; 53 if(!num[p[h].a]) sum; 54 } 55 printf("%d", ans); 56 return 0; 57 }View Code
上一篇：[luoguP3258] [JLOI2014]松鼠的新家（lca + 树上差分）
下一篇：[POJ2594] Treasure Exploration（最小路径覆盖-传递闭包 + 匈牙利算法）
单调队列 模拟
