摘要: 最大生成树,暴力加贪心; #include<bits/stdc++.h>using namespace std;typedef unsigned long long ull;const int N = 2007;ull id[N];int f[N];struct Node{ int i, j; ul 阅读全文
posted @ 2022-11-02 21:21 feuerwerk 阅读(34) 评论(0) 推荐(0)