摘要:
E - Networking#include<iostream> #include<algorithm>
using namespace std;
const int maxn=2000;
struct node
{ int x,y,value; int flag;
}edge[maxn];
int fa[maxn];
int find(int x)
{ return x==fa[x]?x:find(fa[x]);
}
bool cmp(node a,node b)
{ return a.value<b.value;
} int main()
{ int m,n, 阅读全文