感觉这题没啥,主要就是套prim算法模版,然后再根据题目的要求进行计算
代码实现:
package com.DJL.Test;
import java.util.Arrays;
import java.util.Scanner;
public class test1{
static Scanner in = new Scanner(System.in);
static boolean[] vis = new boolean[1005];
static double[] dis = new double[1005];
static double[][] e = new double[1005][1005];
static int INF = 0x7f7f7f7f;
static int n;//顶点数
static int m;//边数
static Node[] nodes = new Node[1002];
static void init()
{
for(int i=0;i<n;i++)
Arrays.fill(e[i],INF);
}
static void prim()
{
double cnt = 0.0;
for(int i=0;i<n;i++)
{
dis[i] = e[0][i];//从下标为0的点开始遍历
}
vis[0] = true;
for(int i=0;i<n-1;i++)
{
double min = INF;
int index = -1;
for(int j=0;j<n;j++)
{
if(!vis[j]&&min>dis[j])
{
min = dis[j];
index = j;
}
}
vis[index] = true;
cnt += dis[index];
//更新dis数组
for(int j=0;j<n;j++)
{
if(!vis[j]&&dis[j]>e[index][j])
{
dis[j] = e[index][j];
}
}
}
System.out.printf("%.2f",cnt);
}
static void getMap()
{
for(int i=0;i<n;i++)
{
nodes[i] = new Node();
nodes[i].x = in.nextInt();
nodes[i].y = in.nextInt();
nodes[i].h = in.nextInt();
}
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
double x = (nodes[i].x-nodes[j].x)*(nodes[i].x-nodes[j].x);
double y = (nodes[i].y-nodes[j].y)*(nodes[i].y-nodes[j].y);
double h = (nodes[i].h-nodes[j].h)*(nodes[i].h-nodes[j].h);
double temp = Math.sqrt(x+y)+h;
e[i][j] = temp;
e[j][i] = e[i][j];
}
}
}
public static void main(String[] args) {
n = in.nextInt();
init();
getMap();
prim();
}
}
class Node
{
int x;//x坐标
int y;//y坐标
int h;//高度
}