摘要：
题意：点数n(n #include#include#include#include#include#include#include#include#include#include#define tree int o,int l,int r#define lson og[N];int ans[N],tf[N],lf[N],vis[N];void init(){ for(int i=0; i=(q[k].b*bit+1)&&v=q[k].l&&v=l&&v<=r) ans-=unionone(lf,i,v); } } return an... 阅读全文
