题目:
Freckles
Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu
Submit Status Practice UVA 10034
Description
In an episode of the Dick Van Dyke show, little Richie connects the freckles on his Dad's back to form a picture of the Liberty Bell. Alas, one of the freckles
turns out to be a scar, so his Ripley's engagement falls through.
Consider Dick's back to be a plane with freckles at various (x; y) locations. Your job is to tell Richie how to connect the dots so as to minimize the amount of ink
used. Richie connects the dots by drawing straight lines between pairs, possibly lifting the pen between lines. When Richie is done there must be a sequence
of connected lines from any freckle to any other freckle.
Input
The input begins with a single positive integer on a line by itself indicating the number of the cases following, each of them as described below. This line is
followed by a blank line, and there is also a blank line between two consecutive inputs.
The rst line contains 0 < n 100, the number of freckles on Dick's back. For each freckle, a line follows; each following line contains two real numbers indicating
the (x; y) coordinates of the freckle.
Output
For each test case, the output must follow the description below. The outputs of two consecutive cases will be separated by a blank line.
Your program prints a single real number to two decimal places: the minimum total length of ink lines that can connect all the freckles.
Sample Input
1
3
1.0 1.0
2.0 2.0
2.0 4.0
Sample Output
3.41
题目大意:
给n个点坐标,求这些点坐标链接最小的费用
题目思路:
1、最小生成树的思路
程序:
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cctype>
#include <fstream>
#include <limits>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cassert>
using namespace std;
bool v[200];
struct street
{
double x,y;
}a[200];
struct node
{
double z;
int w;
friend bool operator < (node b,node c)
{
return b.z>c.z;
}
}b,c;
int main()
{
int ci,n;
scanf("%d",&ci);
while(ci--)
{
memset(v,0,sizeof(v));
priority_queue<node>qu;//采用prim算法
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%lf %lf",&a[i].x,&a[i].y);
b.w=0;b.z=0;
qu.push(b);
double ans=0;
int time =0;
while(~qu.empty())
{
b=qu.top();
qu.pop();
if(v[b.w]) continue;//如果加入过就找下一个
v[b.w]=1;
ans+=b.z;
time++;
if(time==n)//最小生成树的次数
break;
for(int i=0;i<n;i++)//每个遍历点
if(!v[i])
{
c.w=i;
c.z= sqrt(pow(a[i].x-a[b.w].x,2)+pow(a[i].y-a[b.w].y,2));
qu.push(c);
}
}
printf("%.2lf\n",ans);
if(ci)printf("\n");
}
return 0;
}