P r o b l e m l i n k Problem~link Problem link
分析:
把每两队看做两个点 跑最大生成树即可
CODE:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
P r o b l e m l i n k Problem~link Problem link
把每两队看做两个点 跑最大生成树即可
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>