m0_51008760的博客

HDU102Problem DescriptionThere 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 two village A and B are connected, if and only if there is a road between A and

洛谷 P3366 【模板】最小生成树输入输出样例输入 #1复制4 51 2 21 3 21 4 32 3 43 4 3输出 #1复制7说明/提示数据规模：对于 20%20% 的数据，N\le 5N≤5，M\le 20M≤20。对于 40%40% 的数据，N\le 50N≤50，M\le 2500M≤2500。对于 70%70% 的数据，N\le 500N≤500，M\le 10^ 4M ≤10^4 。对于 100%100% 的数据：1\le N\le 50001≤N≤5000