qq_36876305的博客

题目链接：http://acm.hrbust.edu.cn/index.php?m=ProblemSet&a=showProblem&problem_id=2371讲解视频：https://www.bilibili.com/video/av16552942?from=search&seid=6401426487448027126题解：权值线段树+并查集很水，众人皆知。#in...

#include <bits/stdc++.h>using namespace std;const int maxn = 1e5 + 7;struct node{ int lc, rc, v; node () {lc=rc=v=0;}}t[maxn*20];int tot;int a[maxn];int b[maxn];int rt[maxn];i...

题目链接：http://codeforces.com/contest/1006/problem/E题面：In this problem you will have to help Berland army with organizing their command delivery system.There are nn officers in Berland army. The fi...