poj2349(最小生成树)

其实就是个prim的变体，先建立一个最短生成树，然后第s长路就ok

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
#define ma 10000000
#define N 510
#define bi(g) ((g)*(g))
bool cmp(double a,double b)
{
    return a>b;
}
typedef struct{
double x,y;
}Node;
Node a[N];
double dis[N];
double map[N][N];
bool vis[N];
using namespace std;
void prim(int n)
{
vis[1] = false;
for(int i=2; i<=n; ++i)
 dis[i] = map[i][1];
int num = 1;
while(num<n)
{
   double h = ma;
   int m;
 for(int i=2; i<=n; ++i)
   if(vis[i]&&h>dis[i])
   {
    h = dis[i];
    m = i;
   }
  vis[m] = false;
  for(int i=2; i<=n; ++i)
    if(vis[i]&&dis[i]>map[m][i])
    dis[i] = map[m][i];
    ++num;
}
}
int main()
{
  int n;
  cin >> n;
  while(n--)
  {
   memset(vis,true,sizeof(vis));
   int s,p;
   cin>> s>> p;
   for(int i=1; i<=p; ++i)
    cin>> a[i].x>> a[i].y;
   for(int i=1; i<=p; ++i)
    for(int e=i+1; e<=p; ++e)
     map[i][e] = map[e][i] = sqrt(bi(a[i].x-a[e].x)+bi(a[i].y-a[e].y));
   for(int i=1; i<=p; ++i)
    map[i][i] = ma;
   prim(p);
   sort(dis+2, dis+1+p, cmp);
   printf("%.2lf\n",dis[1+s]);
   }
  return 0;
}