HDU6162 Ch's gift

给定一棵树,已知每个点点权$w_i$,每次给定$s,t,a,b$,求从s到t的路径上满足$a\le$点权$\le b$的点的点权和。

点数,询问数$\le 10^5$,多组数据,$w_i,a,b\le 10^9$

Your browser is out-of-date!

Update your browser to view this website correctly. Update my browser now

×