摘要：
```cpp struct LeftTree{ int l,r,val,dis; }t[N]; int fa[N]; inline int Find(int x){ return x == fa[x] ? x : fa[x] = Find(fa[x]); } inline int Merge(int x, int y){ if(!x) return y; if(!y) return x; ... 阅读全文
摘要：
TLE but corrct in most cases. AC with an undescriable magic. cpp inline int Find(int x){ return x == fa[x] ? x : fa[x] = Find(fa[x]); } inline int Mer 阅读全文