POJ 2420 二分法模拟退火算法

最新推荐文章于 2021-01-27 13:54:07 发布

黑猫5027

最新推荐文章于 2021-01-27 13:54:07 发布

阅读量657

点赞数

本文链接：https://blog.csdn.net/zcj5027/article/details/50647118

版权

A Star not a Tree?

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 5055		Accepted: 2433

Description

Luke wants to upgrade his home computer network from 10mbs to 100mbs. His existing network uses 10base2 (coaxial) cables that allow you to connect any number of computers together in a linear arrangement. Luke is particulary proud that he solved a nasty NP-complete problem in order to minimize the total cable length.
Unfortunately, Luke cannot use his existing cabling. The 100mbs system uses 100baseT (twisted pair) cables. Each 100baseT cable connects only two devices: either two network cards or a network card and a hub. (A hub is an electronic device that interconnects several cables.) Luke has a choice: He can buy 2N-2 network cards and connect his N computers together by inserting one or more cards into each computer and connecting them all together. Or he can buy N network cards and a hub and connect each of his N computers to the hub. The first approach would require that Luke configure his operating system to forward network traffic. However, with the installation of Winux 2007.2, Luke discovered that network forwarding no longer worked. He couldn't figure out how to re-enable forwarding, and he had never heard of Prim or Kruskal, so he settled on the second approach: N network cards and a hub.

Luke lives in a loft and so is prepared to run the cables and place the hub anywhere. But he won't move his computers. He wants to minimize the total length of cable he must buy.

Input

The first line of input contains a positive integer N <= 100, the number of computers. N lines follow; each gives the (x,y) coordinates (in mm.) of a computer within the room. All coordinates are integers between 0 and 10,000.

Output

Output consists of one number, the total length of the cable segments, rounded to the nearest mm.

Sample Input

4
0 0
0 10000
10000 10000
10000 0

Sample Output

题目大意：

给出平面上N（<=100）个点，你需要找到一个这样的点，使得这个点到N个点的距离之和尽可能小。输出这个最小的距离和（四舍五入到最近的整数）。

遇到的问题和思路：

首先就是要清楚模拟退火算法。表示我之前也不会，一直看着这位大牛的代码一个一个打下来的http://blog.csdn.net/power721/article/details/6037400

我觉得她的思路很清晰：先假设p[0]是到周围距离之和最小的点。然后用两个while不断地计算其值，第一个是step的随机跑，第二个是用flag，然后周围遍历一下看看有没有更小的值。然后用ans来不断储存即可。

给出AC代码：

#include<cstdio>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>

using namespace std;

int n;
double dx[] = {0, 1, -1, 0};
double dy[] = {1, 0, 0, -1};
struct point{
	double x, y;
};
point p[100 + 5];

double all_sum(point b){
	double sum = 0;
	for (int i = 0; i < n; i++){
		sum += sqrt((p[i].x - b.x) * (p[i].x - b.x) + ((p[i].y - b.y) * (p[i].y - b.y)));
	}
	return sum;
}

int main(){
	while(scanf("%d", &n) != EOF){
		for (int i = 0; i < n; i++){
			scanf("%lf%lf", &p[i].x, &p[i].y);
		}
		point tmp = p[0];
		double mini = all_sum(tmp), step = 1000;

while (step > 0.2){
			double nx, ny;
			int flag = 1;
			point ans, pp;
			while (flag == 1){
				flag = 0;//如果for循环中没有找到，就跳出该while的循环 
				double sum = 0;
				for (int i = 0; i < 4; i++){
					pp.x = tmp.x + step * dx[i], pp.y = tmp.y + step * dy[i];//随机跳跃 
					sum = all_sum(pp);
					if (sum < mini){
						flag = 1;
						mini = sum;
						ans = pp;//用ans来储存 
					}
				}
				tmp = ans;
			}
			step /= 2;
		}
		printf("%d", int(mini + 0.5) * 100 / 100);
	}
	return 0;
}
</cstring></cmath></algorithm></cstdio></cstring></cmath></algorithm></cstdio>