2021 Jiangsu Collegiate Programming Contest F. Jumping Monkey II 树剖+线段树
F.JumpingMonkeyII题意:给你n=2e5n=2e5n=2e5的一棵树,每个点有点权a[i]usingnamespacestd;#definelllonglong#definerep(i,n,m)for(inti=n;i=m;i--)constintN=2e5+10;intn,m,t;vectorv[200050],vv;structnod{intx,id;}z[200050];int