UVA 10034
来源:互联网 发布:js bind 参数 编辑:程序博客网 时间:2024/06/05 17:12
Problem A: Freckles
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 first 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
131.0 1.02.0 2.02.0 4.0
Sample Output
3.41
典型的Prime算法求最小生成树
#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <algorithm>using namespace std;#define N 105#define INF 10000000int n ;bool vis[N] ;double d[N] ;double G[N][N];struct point{ double x ; double y ;}a[N];void input(){ scanf("%d",&n); for(int i = 0 ; i < n ; i++) { scanf("%lf%lf" , &a[i].x , &a[i].y); }}double dis(point a , point b){ return sqrt(pow((a.x - b.x),2) + pow((a.y - b.y) , 2));}void init(){ memset(G , 0 , sizeof(G)); for(int i = 0 ; i < n ; i++) { for(int j = 0 ; j < n ; j++) { if(i == j)continue; G[i][j] = dis(a[i] , a[j]); } }}double Prime(){ memset(vis , false , sizeof(vis)); double ans = 0; int X; vis[0] = true; double minx = INF; for(int i = 0 ; i < n; i++) { d[i] = G[0][i]; } for(int i = 1 ; i < n ; i++) { minx = INF ; for(int j = 0 ; j < n ; j ++) { if(!vis[j]&&d[j] < minx) { minx = d[j]; X = j; } } vis[X] = true; ans += minx; for(int j = 0 ; j < n ; j ++) { if(!vis[j]&&d[j] > G[X][j]) { d[j] = G[X][j]; } } } return ans;}int main(){ //freopen("in.txt" , "r" , stdin); int T; scanf("%d",&T); while(T--) { input(); init(); printf("%.2lf\n",Prime()); if(T)printf("\n"); } return 0;}/**/
- UVA 10034
- uva 10034
- uva 10034
- Uva(10034)
- UVa 10034 Freckles
- UVa 10034 Freckles
- UVa 10034 Freckles
- UVA 10034 - Freckles
- UVA:10034 - Freckles
- UVa 10034 - Freckles
- UVa 10034 Freckles 解答
- UVA 10034 - Freckles
- Uva 10034 - Freckles
- UVA 10034 By ACReaper
- UVA 10034 Freckles
- UVa 10034: Freckles
- UVa:10034 Freckles
- UVA 10034 Freckls
- C++箴言:接口继承和实现继承
- 无题
- PDW中的Split Querying Process
- iOS精华实例之App启动插画的自定义过度
- GitLab升级到5.1注意事项
- UVA 10034
- Linux中时间函数的应用接口
- 六州歌头·玉颜伤
- linux的free命令中,cached和buffers的区别
- arm cortex M3 实现printf
- 64位ubuntu安装32位jdk
- Ueditor入门小结
- 解决ExtJS在firefox里字体显示偏小问题
- C#实现打印功能