LCA
Change_ZHONG
成在坚持
展开
-
tjut 5296
#include #include #include #include #include #include #include #include #include #include using namespace std; template inline bool rd(T &ret) { char c; int sgn; if (c = getch原创 2016-06-07 10:37:28 · 181 阅读 · 0 评论 -
tjut 2586
LCA算法 #include #include #include #define NN 40002 // number of house #define MM 202 // number of query using namespace std; typedef struct node{ int v; int d; struct no原创 2016-06-06 16:44:08 · 195 阅读 · 0 评论 -
tjut 2874
#include #include #include #include using namespace std; const int maxn = 10005; const int maxm = maxn; int head[ maxn ],cnt; struct node{ int from,to,val,next; }edge[ maxm<<2 ]; int deep[ maxn ],原创 2016-08-12 21:25:20 · 138 阅读 · 0 评论