题目//最小生成树，只是变成二维的了#define _CRT_SECURE_NO_WARNINGS#include#include#include#include#include#includeusing namespace std;#define inf 999999999#define M 1010double mat[M][M];struct tt{ double x,y,z,r;}d[M];double prim(int n,int sta){ int mark[M],i,j; double dis[M],sum=0; for(i=0;imat[flag][j... Read More
只是坐标变成三维得了，而且要减去两边的半径而已题目//最小生成树，只是变成三维的了#define _CRT_SECURE_NO_WARNINGS#include#include#include#include#include#includeusing namespace std;#define inf 999999999#define M 110double mat[M][M];struct tt{ double x,y,z,r;}d[M];double prim(int n,int sta){ int mark[M],i,j; double dis[M],sum=0; ... Read More