【POJ 2420】 A Star not a Tree?（模拟退火）

【POJ 2420】 A Star not a Tree?（模拟退火）

A Star not a Tree? Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 4788   Accepted: 2326 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 28284 Source Waterloo Local 2002.01.26

以前经常遇到模拟退火 然而已知没遇到实题 没能用于实践 也没能理解 毕竟论文什么的讲的都很抽象

今天做题遇到这个 根本没想到会用这个方法

模拟退火 并不是字面意思 而是一种化学变化 在物体内部的一种反应 不断降温 每当到一个温度会先趋向于稳定状态 再继续降温（个人理解）

用到编程上  就是个迭代 不断缩小答案的偏移量 也就是温度

每到一个偏移量 找出这个偏移量下的最优解 也就是在这个偏移量下往所有位置搜索 贪心的找最优（稳定状态） 毕竟随机算法…… 

找到就更新 直到找不到 把温度（偏移量）降低 接着找 已知找到一个边界（自己估计个）

代码如下：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>

using namespace std;
const int INF = 0x3f3f3f3f;

struct Point
{
    double x,y;
    Point(){}
    Point(double _x,double _y):x(_x),y(_y){}
    double operator ^ (const struct Point a)const
    {
        return sqrt((x-a.x)*(x-a.x)+(y-a.y)*(y-a.y));
    }
};

Point pt[111];
int n;

double aldis(double x,double y)
{
    double ans = 0;
    Point p = Point(x,y);
    for(int i = 0; i < n; ++i) ans += p^pt[i];
    return ans;
}

int main()
{
    //st----温度 mn-----答案
    double st,mn,tmp,x,y;
    bool f;
    while(~scanf("%d",&n))
    {
        for(int i = 0; i < n; ++i) scanf("%lf %lf",&pt[i].x,&pt[i].y);

        st = 10000;
        x = y = 0;
        mn = aldis(x,y);
        //st = 10000是初始温度 f表示该偏移量下是否仍可让答案更优 st > 0.2表示边界
        for(st = 10000,f = 1; st > 0.2; st = st/2, f = 1)
        {
            //f == 1  该温度下未到最优 继续退(迭代)
            while(f)
            {
                f = 0;
                for(int i = -1; i <= 1; ++i)
                {
                    for(int j = -1; j <= 1; ++j)
                    {
                        tmp = aldis(x+st*i,y+st*j);
                        //评价函数
                        if(tmp < mn)
                        {
                            x = x+st*i;
                            y = y+st*j;
                            f = 1;
                            mn = tmp;
                        }
                    }
                }
            }
        }
        printf("%.0f\n",mn);
    }

    return 0;
}