课程练习四-ProblemB
来源:互联网 发布:plc编程软件安卓手机版 编辑:程序博客网 时间:2024/05/07 05:12
Problem DescriptionEddy 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.<br>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?<br>InputThe first line contains 0 < n <= 100, the number of point. For each point, a line follows; each following line contains two real numbers indicating the (x,y) coordinates of the point. <br><br>Input contains multiple test cases. Process to the end of file.<br>OutputYour program prints a single real number to two decimal places: the minimum total length of ink lines that can connect all the points. <br>Sample Input31.0 1.02.0 2.02.0 4.0Sample Output3.41
题意:
给你N个点的坐标,求能使这N个点的所有边都相连的边最小长度。
思路:
直接Prim模板。
代码:
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
struct Node
{
double x;
double y;
}A[110];
double G[110][110], low[110];
int vis[110];
void Prim(int N)
{
memset(vis, 0, sizeof(vis));
int pos = 1;
vis[pos] = 1;
double ans = 0;
for (int i = 1; i <= N; i++)
if (i != pos)
low[i] = G[pos][i];
for (int i = 1; i < N; i++)
{
double Min = 0x7ffffff;
for (int j = 1; j <= N; j++)
{
if (!vis[j] && Min > low[j])
{
Min = low[j];
pos = j;
}
}
vis[pos] = 1;
ans += Min;
for (int j = 1; j <= N; j++)
{
if (!vis[j] && low[j] > G[pos][j])
low[j] = G[pos][j];
}
}
printf("%.2lf\n", ans);
}
int main()
{
int N;
double Dist, x, y;
while (cin >> N)
{
for (int i = 1; i <= N; i++)
{
for (int j = 1; j <= N; j++)
G[i][j] = 0x7fffff;
}
memset(A, 0, sizeof(A));
for (int i = 1; i <= N; i++)
{
cin >> A[i].x >> A[i].y;
}
for (int i = 1; i <= N; i++)
{
for (int j = 1; j <= N; j++)
{
x = A[i].x - A[j].x;
y = A[i].y - A[j].y;
Dist = sqrt(x*x + y*y);
G[i][j] = Dist;
}
}
Prim(N);
}
return 0;
}
感想:都是套模板。
- 课程练习四-ProblemB
- 2016sdau课程练习专题一 1001 problemB
- 课程练习四-problemF
- 课程练习四-ProblemH
- 课程练习四-ProblemJ
- 课程练习四-problemW
- 课程练习四-problemR
- 课程练习四-problemQ
- problemB
- problemB
- 课程练习四-problem V
- oracle练习(mldn视频课程)四
- 课程练习四—problem A
- 2016sdau课程练习专题四 1003
- 2016sdau课程练习专题四 1001
- 2016sdau课程练习专题四 1002
- 2016sdau课程练习专题四 1006
- 机器学习课程练习(四)——softmax
- CI框架快速入门2--执行流程图解析
- 银行家算法
- 《maven 实战》笔记
- Java SE-基本数据类型
- 欢迎使用CSDN-markdown编辑器
- 课程练习四-ProblemB
- 许三观卖血记
- android 学习总结之地图添加要素
- 图说C++对象模型
- EasyUI tree加载树
- Windows7/8搭建web(Apache+PHP+MySQL)开发环境
- 剑指offer系列-用两个队列实现栈
- Makefile经典教程(掌握这些足够)
- App后台学习笔记