wode的专栏

#include#include#include#include#include#include#include #include#include#include#define LL long long#define inf 0x7f7f7f7f#define E 1e-9#define N 105#define M 2000000using namespace st

/*题意：给出n个点，m个边。给出每个点的权值，每个边的权值。求建立一棵树，root=1，求这棵树的最小费用，费用=树上每条边*子树中各顶点的权值。思路：root的权值是没用的，而其余节点是必须用的，每条边*子树中各定点的权值=各个点*点到根的最短路，于是转化成了root到各个点的最短路。*/#include#include#include#include#include#in

//spfa方法+deque优化#include#include#include#include#include#include#include#include#include#include#include#define tree int o,int l,int r#define lson o<<1,l,mid#define rson o<<1|1,mid+1,r#