hdu1162
来源:互联网 发布:基于ssh的网上商城源码 编辑:程序博客网 时间:2024/05/16 11:57
Eddy's picture
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2491 Accepted Submission(s): 1198
Problem descriptions as follows: Given you some coordinates pionts on a drawing paper, every point links with the ink with the straight line, causes all points finally to link in the same place. How many distants does your duty discover the shortest length which the ink draws?
Input contains multiple test cases. Process to the end of file.
31.0 1.02.0 2.02.0 4.0
3.41
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
int f[109];
double x[109],y[109];
struct node{
double dist;
int a,b;
}road[10100];
int find(int x)
{
if(x==f[x])
return x;
return find(f[x]);
}
int cmp(const void *a,const void *b)
{
struct node *c,*d;
c=(struct node *)a;
d=(struct node *)b;
return c->dist>d->dist?1:-1;
}
int main()
{
int n,i,j,k;
double sum;
while(scanf("%d",&n)!=EOF)
{
for(i=1;i<=n;i++)
f[i]=i;
for(i=1;i<=n;i++)
scanf("%lf%lf",&x[i],&y[i]);
k=0;
for(i=1;i<=n;i++)//把点存到结构体中
for(j=1;j<i;j++)
{
road[k].a=i;
road[k].b=j;
road[k].dist=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
k++;
}
qsort(road,k,sizeof(road[0]),cmp);
sum=0;
for(i=0;i<k;i++)
{
road[i].a=find(road[i].a);
road[i].b=find(road[i].b);
if(road[i].a!=road[i].b)
{
sum+=road[i].dist;
f[find(road[i].a)]=find(road[i].b);
}
}
printf("%.2f\n",sum);
}
return 0;
}
- hdu1162
- hdu1162
- hdu1162
- hdu1162
- hdu1162
- HDU1162
- hdu1162
- hdu1162
- HDU1162(prim)
- Eddy's picture hdu1162
- hdu1102 & hdu1162 & hdu1232 & hdu1233
- hdu1162-最小生成树
- hdu1162最小生成树
- Eddy's Picture(Hdu1162)
- HDU1162 Eddy's picture
- HDU1162 --kruskal算法基础
- hdu1162-Eddy's picture
- hdu1162-Eddy's picture
- 在eclipse中配置MOTO真机
- JS调用WebService提示"未定义"的解决方法
- loop循环的几种用法
- 深入浅出之正则表达式
- copy_to_user和copy_from_user两个函数的分析
- hdu1162
- 江城子.记7月2日圆明园荷花节
- likely() && unlikely() && __builtin_expect((x), 1)
- Oracle的bug
- mmap5-map the struct file
- 2011-8-8 18:48:31
- 开发工程师人生之路
- MD5
- 代理模式之浅谈