不慌不忙、不急不躁

题目链接：hdu 2874 Connections between cities代码#include <cstdio> #include <cstring> #include <vector> #include <queue> #include <algorithm>using namespace std; typedef pair<int,int> pii; const int maxn = 10

题目链接：hdu 2586 How far away ？代码#include <cstdio> #include <cstring> #include <vector> #include <queue> #include <algorithm>using namespace std; typedef pair<int,int> pii; const int maxn = 40005; const i

题目链接：poj 1330 Nearest Common Ancestors代码#include <cstdio> #include <cstring> #include <vector> #include <queue> #include <algorithm>using namespace std; const int maxn = 1e4 + 5; const int inf = 0x3f3f