蒟蒻 lxw的博客

#include <iostream>#include <cstdio>#include <cstdlib>#include <algorithm>#define mid (l+r>>1)#define lson (o<<1)#defi

题目链接：https://nanti.jisuanke.com/t/38229题目大意：给一颗树，m次查询ui->vi这条链中边权小于等于ki的边数。做法一：树链剖分+主席树（这里并不需要进行离散化，但是比赛的时候忘了）#include <bits/stdc++.h>#define mid (l+r>>1)#define lson (o<&...

题目链接：https://cn.vjudge.net/problem/HDU-6504做法一：启发式合并，用unorder_map维护每个子树的颜色信息。需要用到第x个颜色的总数，和第x个颜色在第i棵子树内的个数来判断删除第i棵子树后的答案变化。#include<bits/stdc++.h>#define rep(i, a, b) for(int i = (a); i ...