iwi

题目：树的统计思路：树剖参考： 吊打集训队的zcy的代码 几乎是照着抄的……数据生成器:#include<bits/stdc++.h>using namespace std;#define maxn 10#define maxm 10#define maxa 10#define Rand() (rand()+rand()%19260817)int...

题目：树链剖分注意：线段树区间处理时左右区间不要颠倒。代码：#include<bits/stdc++.h>using namespace std;#define read(x) scanf("%d",&x)#define maxn 100000#define ll long longstruct Node { int lstid; int w,fa; ...

题目：树上操作思路：树剖模板题。代码：#include<bits/stdc++.h>using namespace std;#define read(x) scanf("%lld",&x)#define maxn 100000#define ll long longstruct Node { ll lstid; ll w,fa; ll sz,d,hso...

题目：软件包管理器思路：树剖模板题。代码：#include<bits/stdc++.h>using namespace std;#define maxn 100000#define read(x) scanf("%d",&x)int n;struct Node{ int lstid; int fa,hson; int sz,d,tp;};Nod...