摘要：
There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say t 阅读全文
摘要：
You are assigned to design network connections between certain points in a wide area. You are given a set of points in the area, and a set of possible 阅读全文
摘要：
#include<iostream> #include<algorithm> using namespace std; int ans=0,tot=0; const int N = 1e5; int f[200]; struct ac{ int v,u,w; }edge[N]; bool cmp(a 阅读全文