tjx41624560的博客

原题链接Background Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way from the place his

原题链接思路：把男生女生都当作顶点，把把亲密度的负数当作权值，就是最小生成树问题。AC代码：#include <iostream> #include <cstdio> #include <algorithm> #include <cstdlib> #include <cstring> using namespace std; //《挑战》 P109 //把男生女生都当作顶点，把把亲密度的负数当作权

原题链接思路：经典最小生成树问题。AC代码：#include <iostream> #include <cstdio> #include <algorithm> #include <cstdlib> #include <cstring> #include <cmath> using namespace std;//思路：图论，最小生成树，prim选点法（kruskal选边法也可） int N; in