poj 2349 prim

//就是求最小生成树
//保证所有前哨之间能直接或间接相连就是最小生成树
//由于有S个卫星，则将S个卫星应用于路径最长的S-1条路
//那么就要求生成树所有边的去掉最长的S-1条边后的最大边的长度
//即从生成树边中去掉最长的s-1条，然后剩余的最大边就是结果
//我在fedora下用g++编译，之前把dis函数写成distance报了一堆错，原因是g++库里面 也有个//distance,真坑爹
#include <iostream>
#include <cstdio>
#include <algorithm>
//#include <vector>
#include <cmath>
#include <cstring>
#define INF 100000
#define MAXN 501
using namespace std;
int N;

double Edge[MAXN][MAXN];
int S,P;
double res;

double lowcost[MAXN];
double path[MAXN];
int po;

struct point
{
  double x,y;
}points[MAXN];

double dis(point a,point b)
{
  return sqrt((a.x-b.x)*(a.x-b.x) + (a.y-b.y)*(a.y-b.y));
}

void prim()
{
  lowcost[0] = -1;
  int v;
  
  po = 0;
  for(int i = 1; i < P; i++)
    {
      lowcost[i] = Edge[0][i];
    }
  for(int i = 1; i < P; i++)
    {
      double min = INF;
      for(int k = 0; k < P; k++)
	{
	  if(lowcost[k] != -1 && lowcost[k] < min)
	    {
	      v = k;
	      min = lowcost[k];
	    }
	}
    
      path[po] = min;
      po++;
      lowcost[v] = -1;
      for(int k = 0; k < P; k++)
	{
	  if(lowcost[k] > Edge[v][k])
	    {
	      lowcost[k] = Edge[v][k];
	    }
	}
    }
}


int main()
{
  cin>>N;
  while(N--)
    {
      cin>>S>>P;
      for(int i = 0; i < P; i++)
	{
	  cin>>points[i].x>>points[i].y;
	}
      for(int i = 0; i < P-1; i++)
	{
	  for(int j = i + 1; j < P; j++)
	    {
	      Edge[i][j] = Edge[j][i] = dis(points[i],points[j]);
	    }
	}
      memset(lowcost,0,sizeof(lowcost));
      prim();
      sort(path,path + po);
      res = 0;
      
      for(int i = 0; i <= po-S; i++)
	{
	  res = res > path[i]? res:path[i];
	  // cout<<path[i]<<endl;
	}
      printf("%.2f\n",res);
    }
  return 0;
}