摘要：Problem Description Coach Pang is interested in Fibonacci numbers while Uncle Yang wants him to do some research on Spanning Tree. So Coach Pang decid 阅读全文

摘要：Hello everyone! I am your old friend Rikka. Welcome to Xuzhou. This is the first problem, which is a problem about the minimum spanning tree (MST). I 阅读全文

摘要：①克鲁斯卡尔算法（Kruskal） n是顶点数，m是边数； cnt是已连的边数，如果已连的边数=总点数-1，即可跳出。 #include<bits/stdc++.h> #define MAX 1005 using namespace std; int p[MAX],n,m; struct edge{ 阅读全文