关于 LCT(Li Chao Tree)写法:
return min(f(w,h[v]),min(query(ls,l,mid,v),query(rs,mid+1,r,v)));
return min(f(w,h[v]),h[v]<=mid? query(ls,l,mid,v):query(rs,mid+1,r,v));
h[i]
h[j]
-2