Eddy's picture problem b
2016-06-27 20:54
176 查看
Problem Description
Eddy begins to like painting pictures recently ,he is sure of himself to become a painter.Every day Eddy draws pictures in his small room, and he usually puts out his newest pictures to let his friends appreciate. but the result it can be imagined, the friends
are not interested in his picture.Eddy feels very puzzled,in order to change all friends 's view to his technical of painting pictures ,so Eddy creates a problem for the his friends of you.
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?
题目大意:
给你一些点的坐标,然后求连通这些点的最小线段的长度。
解题思路:
其实也就是最小生成树的裸题。只不过需要对这n个点全部处理一下,求出每对点之间的长度,然后存入邻接矩阵。然后就KO了。。
#include <stdio.h>
#include <math.h>
#include <string.h>
#define MAXN 105
#define UPPERDIS 999999
double lowcost[MAXN],vist[MAXN];
double cost[MAXN][MAXN];
int n;
double prim(int v0)
{
int i, j, minone;
double mindis;
double ans = 0;/*用来记录最小生成树的总长度*/
memset(vist, 0, sizeof(vist));
/*各点距离初始化*/
for(i = 0;i < n;i++)
{
lowcost[i] = cost[v0][i];
}
vist[v0] = 1;
for(i = 0;i < n-1;i++)
{
mindis = UPPERDIS;
for(j = 0;j < n;j++)
if(!vist[j] && mindis > lowcost[j])
{
mindis = lowcost[j];
minone = j;
}
/*将找到的最近点加入最小生成树*/
ans += mindis;
vist[minone] = 1;
/*修正其他点到最小生成树的距离*/
for(j = 0;j < n;j++)
if(!vist[j] && cost[minone][j] < lowcost[j])
{
lowcost[j] = cost[minone][j];
}
}
return ans;
}
struct point {
double x, y;
}p[MAXN];
double dis(point p1, point p2)
{
return sqrt((p1.x - p2.x) * (p1.x - p2.x) + (p1.y - p2.y) * (p1.y - p2.y));
}
int main()
{
int i, j;
while (~scanf("%d", &n))
{
for(i = 0; i < n; i++)
scanf("%lf%lf", &p[i].x, &p[i].y);
for(i = 0; i < n; i++)
for(j = i; j < n; j++)
if(j == i)
cost[i][i] = 1000000.0;
else
cost[i][j] = cost[j][i] = dis(p[i], p[j]);
printf("%.2lf\n",prim(0));
}
}
Eddy begins to like painting pictures recently ,he is sure of himself to become a painter.Every day Eddy draws pictures in his small room, and he usually puts out his newest pictures to let his friends appreciate. but the result it can be imagined, the friends
are not interested in his picture.Eddy feels very puzzled,in order to change all friends 's view to his technical of painting pictures ,so Eddy creates a problem for the his friends of you.
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?
题目大意:
给你一些点的坐标,然后求连通这些点的最小线段的长度。
解题思路:
其实也就是最小生成树的裸题。只不过需要对这n个点全部处理一下,求出每对点之间的长度,然后存入邻接矩阵。然后就KO了。。
#include <stdio.h>
#include <math.h>
#include <string.h>
#define MAXN 105
#define UPPERDIS 999999
double lowcost[MAXN],vist[MAXN];
double cost[MAXN][MAXN];
int n;
double prim(int v0)
{
int i, j, minone;
double mindis;
double ans = 0;/*用来记录最小生成树的总长度*/
memset(vist, 0, sizeof(vist));
/*各点距离初始化*/
for(i = 0;i < n;i++)
{
lowcost[i] = cost[v0][i];
}
vist[v0] = 1;
for(i = 0;i < n-1;i++)
{
mindis = UPPERDIS;
for(j = 0;j < n;j++)
if(!vist[j] && mindis > lowcost[j])
{
mindis = lowcost[j];
minone = j;
}
/*将找到的最近点加入最小生成树*/
ans += mindis;
vist[minone] = 1;
/*修正其他点到最小生成树的距离*/
for(j = 0;j < n;j++)
if(!vist[j] && cost[minone][j] < lowcost[j])
{
lowcost[j] = cost[minone][j];
}
}
return ans;
}
struct point {
double x, y;
}p[MAXN];
double dis(point p1, point p2)
{
return sqrt((p1.x - p2.x) * (p1.x - p2.x) + (p1.y - p2.y) * (p1.y - p2.y));
}
int main()
{
int i, j;
while (~scanf("%d", &n))
{
for(i = 0; i < n; i++)
scanf("%lf%lf", &p[i].x, &p[i].y);
for(i = 0; i < n; i++)
for(j = i; j < n; j++)
if(j == i)
cost[i][i] = 1000000.0;
else
cost[i][j] = cost[j][i] = dis(p[i], p[j]);
printf("%.2lf\n",prim(0));
}
}
相关文章推荐
- 六大设计原则
- 进程和线程的区别
- 我的C编译器之路(一)
- python:ImportError: No module named dpkt
- 【iOS】MD5(加密)/AES/Base64加密和解密
- 顺序查找和二分查找
- 毕业一年
- qt 拖拽 修改大小
- confluence(二)--破解
- 简单总结JSP
- B. 【UR #3】铀仓库
- Raphael Js实现以鼠标中心缩放paper
- android 控件ui
- qt 布局
- hdu3560(并查集)
- 第三方登录+分享
- Windows、Linux文件系统和磁盘分区
- Jmeter 登录注册 随机值如何取值
- qt集成dsoframer.ocx打开office办公软件
- A. 【UR #3】核聚变反应强度