DT2131

#include using namespace std;#define ls l,mid,rt*2#define rs mid+1,r,rt*2+1#define mi (l+r)/2const int MAXN=5e4+7;const int INF=0x3f3f3f3f;vector edge[MAXN];vector linkk[MAXN];int n,m,q;in

题意：          中文思路：         染色部分树链剖分即可         对于倒数第K次染色，转化为正数第Q次，线段树维护颜色即可。代码：#include <bits/stdc++.h>using namespace std;#define ls l,mid,rt*2#define rs mid+1,r,rt*2+1#define m...