题意
给定平面内一些点,求最小曼哈顿距离生成树
看这篇咯http://blog.csdn.net/acm_cxlove/article/details/8890003
#include <cstdio>
#include <string>
#include <cstring>
#include <iostream>
#include <algorithm>
#define N 100010
#define X first
#define Y second
using namespace std;
typedef long long ll;
int n,m,cnt,cnt0;
int B[N],C[N],D[N],fa[N];
ll Ans;
struct Point{
int x,y,id;
}A[N];
struct edge{
int u,v,w;
edge(int u=0,int v=0):u(u),v(v){}
friend bool operator <(edge a,edge b){
return a.w<b.w;
}
}E[N<<3];
inline bool cmpx(Point a,Point b){
return a.x<b.x;
}
inline bool cmpy(Point a,Point b){
return a.y<b.y;
}
inline bool back(Point a,Point b){
return a.id<b.id;
}
inline void reaD(int &x){
char c=getchar(); x=0; int f=1;
for(;c>'9'||c<'0';c=getchar())if(c=='-') f=-1;
for(;c>='0'&&c<='9';x=x*10+c-'0',c=getchar()); x*=f;
}
inline int query(int x){
int Min=1<<30,r=-1;
for(;x<=cnt;x+=x&-x)
if(C[x]<Min) Min=C[x],r=D[x];
return r;
}
inline void Add(int x,int y,