//Accepted 6004 KB 924 ms /* source: lightoj1348 time :2015.5.29 by :songt */ /*题解: 树链剖分 */ #include <cstdio> #include <cstring> ; void swap(int &a,int &b) { int t=a; a=b; b=t; } struct Edge { int u,v; Edge(){} Edge(int u,int v):u(u),v…

简单题,看题目就懂. #include<queue> #include<stack> #include<cmath> #include<cstdio> #include<cstring> #include<iostream> #include<algorithm> #define INF 99999999 #define ll __int64 #define lson l,m,rt<<1 #define rso…