#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
#include<cmath>
using namespace std;
const int maxn = 1e6 + 10;
int cnt = 0, po = 0, ans = 0;
int potx[1010], poty[1010], monkey[1010], fa[1010];
double Maxn = -1;
//kruskal+并查集// kruskal本质是加最小边,
struct edge {
int now, to;
double dis;
}e[maxn];
bool cmp(edge x, edge y) {
return x.dis < y.dis;
}int find(int x) {
if (fa[x] != x) {
fa[x] = find(fa[x]);
return fa[x];
}
return x;
}int main()
{
int n, m;
cin >> n;
for (int i = 1; i <= n; i++) {
scanf("%d", &monkey[i]);
}
cin >> m;
for (int i = 1; i <= m; i++) {
scanf("%d%d", &potx[i], &poty[i]);
}
for (int i = 1; i <= m; i++) {
for (int j = i + 1; j <= m; j++) {
e[++cnt].now = i;
e[cnt].to = j;
e[cnt].dis = sqrt((potx[i] - potx[j]) * (potx[i] - potx[j]) + (poty[i] - poty[j]) * (poty[i] - poty[j]));
}
}
sort(e + 1, e + cnt + 1, cmp);//对所有边的长短进行排序
for (int i = 1; i <= m; i++) {
fa[i] = i;//每个点的父亲使其自己,
//并查集在kruskal中的作用是
}
for (int i = 1; i <= cnt; i++) {
if (find(e[i].now) != find(e[i].to)) {//如果这两点的祖宗不一样则表吗两点未连接过,可以连接
int fx = find(e[i].now), fy = find(e[i].to);//kruskal并查集用,防止出现环
fa[fx] = fy;
po++;//记录边的数量
Maxn = max(Maxn, e[i].dis);
}
if (po == m - 1) break;//如果边的数量等于顶点减一,则最小生成树完成.
}
for (int i = 1; i <= n; i++) if (monkey[i] >= Maxn) ans++;
cout << ans;}
[图论]最小生成树kruskal(P2504 [HAOI2006]聪明的猴子)
最新推荐文章于 2024-08-23 16:51:26 发布